000 -LEADER |
fixed length control field |
a |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OSt |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20250106164137.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
250106b xxu||||| |||| 00| 0 eng d |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
AIKTC-KRRC |
Transcribing agency |
AIKTC-KRRC |
100 ## - MAIN ENTRY--PERSONAL NAME |
9 (RLIN) |
24984 |
Author |
Rathod, Subhash |
245 ## - TITLE STATEMENT |
Title |
Visualization and comparative simulation of pathfinding, searching and sorting algorithms. |
250 ## - EDITION STATEMENT |
Volume, Issue number |
Vol.38(2), Oct |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
Sangli |
Name of publisher, distributor, etc. |
K.E. Society's Rajarambapu Institute of Technology |
Year |
2024 |
300 ## - PHYSICAL DESCRIPTION |
Pagination |
96-105p. |
520 ## - SUMMARY, ETC. |
Summary, etc. |
This study addresses the need for enhanced algorithms learning through the utilization of comparative simulation and visualization. Motivated by the challenge of comprehending complex algorithms, we emphasize the efficacy of visualization tools. Our research explores the realtime rendering of algorithms in a visual format, facilitating a deeper understanding of their underlying mechanisms. In addition, we introduce a novel comparative simulation feature within our Algorithm Visualizer e-learning application, enabling learners to contrast the performance of diverse algorithms, discern their strengths and weaknesses, and evaluate their applicability to different data sets. Specifically, this application accommodates various algorithms, including Dijkstra's algorithm, DFS, BFS, Binary Search, and more. Learners can employ this tool to scrutinize algorithmic differences and efficiency, exemplified through scenarios like comparing Dijkstra's algorithm and A* algorithm for pathfinding on a map. Furthermore, this feature extends to the evaluation of sorting algorithms, such as Quick Sort and Merge Sort, allowing users to visualize their performance on large data sets. In conclusion, the Algorithm Visualizer e-learning application serves as a valuable resource for learners, enhancing algorithmic comprehension through comparative simulation and visualization techniques. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
9 (RLIN) |
4642 |
Topical term or geographic name entry element |
Humanities and Applied Sciences |
700 ## - ADDED ENTRY--PERSONAL NAME |
9 (RLIN) |
24985 |
Co-Author |
Mishra, Abhinav |
773 0# - HOST ITEM ENTRY |
Title |
Journal of engineering education transformations (JEET) |
International Standard Serial Number |
2349-2473 |
Place, publisher, and date of publication |
Sangli Rajarambapu Institute Of Technology |
856 ## - ELECTRONIC LOCATION AND ACCESS |
URL |
https://journaleet.in/articles/visualization-and-comparative-simulation-of-pathfinding-searching-and-sorting-algorithms |
Link text |
Click here |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Source of classification or shelving scheme |
|
Koha item type |
Articles Abstract Database |