SortPath Visual Studio

“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*

Authors

Publication Details

Journal
INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT
Published
2025-03-31
DOI
https://doi.org/10.55041/ijsrem43430
Primary Topic
Spatial Cognition and Navigation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SortPath Visual Studio

Deepa Athawale, Aaryan Agrahari, Pratik Dawkhar, Harsh Jadhav et al.
INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT
Spatial Cognition and Navigation
article

SortPath Visual Studio

Deepa Athawale, Aaryan Agrahari, Pratik Dawkhar, Harsh Jadhav, Hamza Sayyad
article en

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*

INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENTVol. 09(03)
Openalex Percentile: Top 95%
Spatial Cognition and Navigation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.