{"id":48688513,"url":"https://github.com/amirallami-code/binary-search-algorithm","last_synced_at":"2026-04-11T04:38:55.515Z","repository":{"id":170866280,"uuid":"647056800","full_name":"amirallami-code/binary-search-algorithm","owner":"amirallami-code","description":"This repository houses a robust implementation of the binary search algorithm. Binary search is a highly efficient method for locating an item in a sorted list by systematically dividing the search interval in half.","archived":false,"fork":false,"pushed_at":"2025-06-23T15:32:16.000Z","size":948,"stargazers_count":50,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-04-11T04:38:54.851Z","etag":null,"topics":["algorthims","binary-search-algorithm","binary-search-tree","javascript","js"],"latest_commit_sha":null,"homepage":"https://binary-search-algorithm.vercel.app","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/amirallami-code.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-05-30T01:11:04.000Z","updated_at":"2026-04-05T17:55:53.000Z","dependencies_parsed_at":null,"dependency_job_id":"e583ac57-6a82-46f8-82ca-3f1a79d42008","html_url":"https://github.com/amirallami-code/binary-search-algorithm","commit_stats":null,"previous_names":["amirallami-code/binarysearch-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/amirallami-code/binary-search-algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fbinary-search-algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fbinary-search-algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fbinary-search-algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fbinary-search-algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/amirallami-code","download_url":"https://codeload.github.com/amirallami-code/binary-search-algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/amirallami-code%2Fbinary-search-algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31669117,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-10T17:19:37.612Z","status":"online","status_checked_at":"2026-04-11T02:00:05.776Z","response_time":54,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorthims","binary-search-algorithm","binary-search-tree","javascript","js"],"created_at":"2026-04-11T04:38:55.288Z","updated_at":"2026-04-11T04:38:55.498Z","avatar_url":"https://github.com/amirallami-code.png","language":"JavaScript","readme":"# Binary Search Algorithm\n\n![Binary Search Demo](images/demo.jpg)\n\n[![MIT License](https://img.shields.io/badge/License-MIT-blue)](https://opensource.org/licenses/MIT)\n![Last Update](https://img.shields.io/github/last-commit/amirallami-code/binary-search-algorithm?style=flat\u0026color=yellow)\n[![Stars](https://img.shields.io/github/stars/amirallami-code/binary-search-algorithm?style=flat\u0026color=yellow)](https://github.com/amirallami-code/binary-search-algorithm/)\n![PRs Welcome](https://img.shields.io/badge/PRs-welcome-brightgreen)\n![Contributions Welcome](https://img.shields.io/badge/Contributions-welcome-brightgreen)\n\nAn efficient implementation of the binary search algorithm, optimized for rapid number searching.\n\n## Table of Contents\n\n- [Overview](#overview)\n- [Features](#features)\n- [How It Works](#how-it-works)\n- [Demo](#demo)\n- [Installation](#installation)\n- [Usage](#usage)\n- [Contributing](#contributing)\n- [License](#license)\n- [Contact](#contact)\n\n## Overview\n\nThis repository houses a robust implementation of the binary search algorithm. Binary search is a highly efficient method for locating an item in a sorted list by systematically dividing the search interval in half.\n\n## Features\n\n- Lightning-fast search algorithm\n- Optimized for numerical searches\n- No manual input required for search targets\n- Ideal for large datasets\n\n## How It Works\n\nBinary search operates on the principle of divide and conquer:\n\n1. Initialize with the complete sorted list.\n2. Compare the target value with the middle element.\n3. If there's a match, the search concludes.\n4. If the target is less than the middle element, repeat the search on the lower half.\n5. If the target is greater, repeat the search on the upper half.\n6. Continue this process until the target is found or the search space is exhausted.\n\nThis approach significantly reduces search time, especially in extensive datasets.\n\nHere's a few examples of how this algorithm actually works\n\n\u003cp align=\"center\"\u003e\n  \u003cimg width=\"750\" height=\"auto\" src=\"assets/binary-search-algorithm2.gif\"\u003e\n\u003c/p\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003cimg width=\"750\" height=\"auto\" src=\"assets/binary-search-algorithm.gif\"\u003e\n\u003c/p\u003e\n\n\u003cdiv align=\"center\"\u003e\n  \u003ca href=\"https://youtu.be/DRsJ8sA9xzc?si=JPRl0YHB3JSCaS_A\"\u003eGif ref\u003c/a\u003e\n\u003c/div\u003e\n\n## Demo\n\nExperience the algorithm in action: [Binary Search Demo](https://binary-search-algorithm.vercel.app)\n\n## Installation \n\nClone the repository to your local machine: \n```bash \n      git clone https://github.com/amirallami-code/binary-search-algorithm.git cd binary-search-algorithm\n```\n\n## Usage\n\n1. Execute the program.\n2. Respond to the prompts accurately.\n3. The algorithm will swiftly locate your number using binary search.\n\n\u003e**Note:** Precision in your responses is crucial; inaccurate inputs may lead to incorrect results.\n\n## Contributing\n\nWe enthusiastically welcome contributions! To contribute:\n\n1. Fork the project.\n2. Create your feature branch (`git checkout -b feature/AmazingFeature`).\n3. Commit your changes (`git commit -m 'Add some AmazingFeature'`).\n4. Push to the branch (`git push origin feature/AmazingFeature`).\n5. Open a pull request.\n\n## License\n\nThis project is currently under the MIT license. For more information, see the [LICENSE](LICENSE) file.\n\n## Contact\n\nFor questions or concerns, please contact:\nAmirhossein Allami - [amirallami.dev@gmail.com](mailto:amirallami.dev@gmail.com)\n\nProject Link: [https://github.com/amirallami-code/binary-search-algorithm](https://github.com/amirallami-code/binary-search-algorithm)\n\n---\n\n⭐ Star this repository if you find it helpful.","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famirallami-code%2Fbinary-search-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Famirallami-code%2Fbinary-search-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Famirallami-code%2Fbinary-search-algorithm/lists"}