ITMO University
“Programming Technologies” Department

Classical and automaton implementations of heapsort algorithm visulaizer

© G.G. Udov, A.A. Shalyto

Saint-Petersburg State University of Information Technologies, Mechanics and Optics

Project documentation in Russian (PDF)

Classical implementation
Source code
Visualizer (English, online)

Automata-based implementation
Source code
Visualizer (English, online)

Annotation

In this work the heapsort algorithm is examined. The analysis of literature was prepared, the thorough description of algorithm was compiled. The input data cases when this algorithm is the most effective sorting algorithm are defined.

We present two implementations of algorithm: classical one and one that created using state-based approach. We also present two visualizers built on the base of these implementations.

The project documentation was prepared and the source code of visualizers was published.