Sharing files using a Lacewing Web server...

[Korjon]

Hi.
The fast loop goes though the high score list comparing each element with the CurrentScore thats being inserted.
When CurrentScore is greater than the element, it marks that index as the insertion point then moves all remaining elements so we can use that index for CurrentScore.

Adding a secondary sort order just requires another comparison event when finding the insertion index.