Heapsort in a list (really fast sorting)

See inside

Generate a new list: generates a new list of random numbers ranging from -1000.0 to 1000.0.
Sort: Sorts the list in ascending order.

List length: the length of the generated list.
x10: If 1, the chosen length is multiplied by 10.
Norm: The number of digits after the decimal.

Notes and Credits

This project was built to demonstrate the implementation of Heapsort in Scratch. This is an algorithm for very fast sorting of lists! It can easily sort lists with more than 1,000 items.
The complexity is in the order of O(x*logx), where x is the length of the list.


Shared: 25 Jul 2013 Modified: 7 Nov 2013
Favorite this project 14
Love this project 17
Total views 571
View the remix tree  1
More projects by Mister_Guacamole