• Aditi Parolkar
• Samkit Jain
• Aryaman Singh Pundir
• Prof. Vandana Kate
• Prof. Shruti Lashkari

The rapid advancement of technology has led to the development of essential algorithms for solving complex problems. Understanding these algorithms is crucial but can be challenging without visual aids. This research explores algorithm visualization through a comprehensive platform covering three key domains: sorting, networking, and shortest path generation. The sorting visualizer offers interactive tools to observe and compare sorting algorithms like bubble sort, insertion sort, merge sort, and quicksort. Users can analyze their efficiency through real-time execution on randomly generated datasets. The networking visualizer simulates network algorithms, al- lowing users to explore routing, network flow, and graph traver- sal. By visualizing data packet movement and path optimization, users gain deeper insights into network dynamics. The shortest path generator demonstrates algorithms like Dijkstra’s and A* search, showing how heuristics and data structures impact pathfinding. Users can also explore real-world applications such as GPS navigation and network routing. Our platform enhances algorithm education by providing interactive visualizations that bridge the gap between theory and practice, offering a user-friendly and immersive learning experience.

Visualizing Algorithms: A Multi-Domain Exploration of Sorting, Networking, and Pathfinding

"Visualizing Algorithms: A Multi-Domain Exploration of Sorting, Networking, and Pathfinding", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.12, Issue 5, page no.4-8, May-2025, Available :http://www.jetir.org/papers/JETIRGV06002.pdf

"Visualizing Algorithms: A Multi-Domain Exploration of Sorting, Networking, and Pathfinding", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.12, Issue 5, page no. pp4-8, May-2025, Available at : http://www.jetir.org/papers/JETIRGV06002.pdf