Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ARTCom.2009.20 | ARTCom |
Keywords | Field | DocType |
computer animation,computational complexity,time complexity,searching algorithm,sorting,algorithm design and analysis,algorithms,data visualisation,data visualization,visualization,animation,data mining,sorting algorithm | Search algorithm,Computer science,Theoretical computer science,Artificial intelligence,Time complexity,Sorting algorithm,Data visualization,Visualization,Algorithm,Sorting,Computer animation,Machine learning,Computational complexity theory | Conference |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Bremananth | 1 | 6 | 2.03 |
| V. Radhika | 2 | 1 | 0.72 |
| S. Thenmozhi | 3 | 0 | 0.34 |