Space to sort. There are a few sorting a sorting algorithmes (each a different block) inside the project, so just plug in the one you want and test it. In the demo, this is using heapsort. At the end, it also searches for a random value, and gives it's location in output if it's found. It uses binary search, which only works on a sorted list.
All by me
