SortPath Visual Studio
Aaryan Agrahari1, Pratik Dawkhar2, Harsh Jadhav3 , Hamza Sayyad4, Prof. Deepa Athawale5
1,2,3,4B.E student Department of Computer Engineering Bharat College of Engineering, Badlapur
5 Professor, Department of Computer Engineering, Bharat College of Engineering, Badlapur, Thane, Maharashtra - 421503
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract -
“SortPath Visual Studio” is an interactive algorithm visualization platform designed to help students to understand complex sorting and pathfinding algorithms through real-time visual representation. The system features two user roles: Teacher and Student. Students can explore sorting and pathfinding visualizers, each supporting multiple algorithms. Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Heap Sort are few of the features of the sorting visualizer offering input size, speed, and node visualisation choices. Pathfinding visualiser offers BFS, DFS, A*, and Dijkstra's Algorithm, where users can simulate real-life navigation challenges by inputting start node and end node, obstacles, and grid topologies. The key feature of this system is randomised generation, where students can try out different input sets, for example, random tile/line generation in sorting and random maze/wall generation in pathfinding. Instructors can track student progress, check assignment submissions, and evaluate learning outcomes. This platform bridges the gap between theory and practice, making it an essential tool for students, educators, and algorithm enthusiasts to deepen their understanding of fundamental algorithmic concepts. Theoretical usability of the given e-studying program is made evident through visual aid technology. The initial test findings indicate that the e- studying instrument is usable and can potentially assist college students to build effective mental models for quickest path algorithms.
Key Words: Visualization of Sorting Algorithms: Bubble Sort, Selection Sort, , Bubble Sort, Insertion Sort, Merge Sort, Heap Sort. and Pathfinding Algorithms: Dijkstra’s algorithm, BFS, DFS, A*
