Example Answer
**************
for Exercise 6.2

Originally we did a sorted insert. 
We now compare it to something like append & sort. 

Both ways give correct results. 
For append & sort it's important to first check if the new score deserves a place in the highscore. 
By definition this means that the new score is better than the lowest score in the table. 
As a consequence of this it's correct to replace the lowest score. 
But since the new score also could be better than any other of the existing scores, we need the sorting afterwards to maintain the correct order. 

Let's say the list length is n. 

For append & sort we only need to go through half of the list on average. 
So the runtime complexity is O(n). 

Appending is only one step but sorting using bubble sort has runtime O(n²) which is n times worse than O(n).