An application for distance learning of data structures and sorting algorithms
In the paper an application for demonstration and analysis of data structures and sorting algorithms is presented. Their operation can be animated and demonstrated on asserted or generated input data, with different statistical distributions. Analysis of the performance and of the complexity of vari...
Saved in:
Published in | ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534) pp. 135 - 140 vol.1 |
---|---|
Main Author | |
Format | Conference Proceeding |
Language | English |
Published |
Zagreb
IEEE
2002
University Computing Centre |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In the paper an application for demonstration and analysis of data structures and sorting algorithms is presented. Their operation can be animated and demonstrated on asserted or generated input data, with different statistical distributions. Analysis of the performance and of the complexity of various algorithms can be calculated and/or measured. |
---|---|
ISBN: | 9539676959 9789539676955 |
ISSN: | 1330-1012 |
DOI: | 10.1109/ITI.2002.1024664 |