Binary Search Visualizer

A Binary Search Visualizer let you visualize how binary search works by giving you the output of each iteartion.


View Demo · Report Bug · Request Feature

About The Project

A very simple binary search visualizer that takes numbers separted by comma as input and another number to search in the input. It then searchs item inside those values using binary search and output each iteration along with its Upper Bound , Lower Bound and its Midpoint .

Built With

• React.js
• React-Bootstrap

Getting Started

To run this project you would require Node v14 or above and npm installed on your computer.

Installation

1. Clone the repo

   git clone https://github.com/faris-xhan/binary-search-visualizer.git

2. Install NPM packages

   npm install

3. Start the development server. 🔨

   npm start

4. Start the build. ✨

   npm run build

Roadmap

• ✔️ Add a progress bar during searching.
• ✔️ Add a README
• ✔️ Change alert varaint based on item found or not.
• ⬛ Add a switch for sorted & unsorted input.
• ⬛ Limit the user input to only 100 values in production.

Contributing

Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.

If you have a suggestion that would make this better, please fork the repo and create a pull request. You can also simply open an issue with the tag "enhancement". Don't forget to give the project a star! Thanks again!

1. Fork the Project
2. Create your Feature Branch (git checkout -b feature/AmazingFeature)
3. Commit your Changes (git commit -m 'Add some AmazingFeature')
4. Push to the Branch (git push origin feature/AmazingFeature)
5. Open a Pull Request

License

Distributed under the MIT License.

Contact

Mohammad Naeem - @nemoxhan - nemoxhan@gmail.com

Project Link: https://github.com/faris-xhan/binary-search-visualizer