Heapsort in a list (really fast sorting)
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.
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.