A mini project for Design and Analysis of Algorithms – 5th Semester
Developed to visually demonstrate how the Binary Search algorithm works through engaging web animations.
This project is an interactive visual demonstration of the Binary Search algorithm, built using HTML, CSS, and JavaScript.
The animation is designed to make it easier for students and learners to grasp the divide-and-conquer approach used in Binary Search, step-by-step.
Create an animation demonstration using HTML, CSS, and JavaScript for Binary Search implementation
as part of the Design and Analysis of Algorithms coursework in the 5th semester.
- 🧠 Demonstrates the logic of Binary Search in an intuitive and animated way
- 🖱️ Allows step-by-step visualization of how the middle element is selected and the array is divided
- 🎨 Built using pure web technologies – no frameworks required
- 📊 Helps in understanding algorithm efficiency and flow
Rohit Deshmukh
B.Tech. Computer Science, 6th Semester
📫 Email: [email protected]
💼 LinkedIn: linkedin.com/in/rohitdeshmukh27
💻 GitHub: github.com/rohitdeshmukh27
This project was created as part of the Design and Analysis of Algorithms course.