DocumentCode
2350480
Title
Visualizing Sequence of Algorithms for Searching and Sorting
Author
Bremananth, R. ; Radhika, V. ; Thenmozhi, S.
Author_Institution
Dept. of Comput. Applic., Sri Ramakrishna Eng. Coll., Coimbatore, India
fYear
2009
fDate
27-28 Oct. 2009
Firstpage
647
Lastpage
649
Abstract
In this paper sequence of execution of algorithms are explained visually in an interactive manner. It helps to realize the fundamental concept of algorithms such as searching and sorting method in a simple manner. Visualization gains more attention than theoretical study and it is an easy way of learning process. We propose methods for finding runtime of each algorithm and aims to overcome the drawbacks of the existing character systems. System illustrates each and every step clearly using text and animation. Comparisons of its time complexity have been carried out and results show that our approach provides better perceptive of algorithms.
Keywords
computational complexity; computer animation; data visualisation; search problems; sorting; algorithm sequence visualization; animation; searching algorithm; sorting algorithm; time complexity; Algorithm design and analysis; Animation; Communications technology; Computer applications; Data visualization; Educational institutions; Electronic mail; Resumes; Runtime; Sorting; Algorithms; Searching; Sorting; Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Advances in Recent Technologies in Communication and Computing, 2009. ARTCom '09. International Conference on
Conference_Location
Kottayam, Kerala
Print_ISBN
978-1-4244-5104-3
Electronic_ISBN
978-0-7695-3845-7
Type
conf
DOI
10.1109/ARTCom.2009.20
Filename
5329052
Link To Document