Sort descriptions on 'code' page

[quarks]

I came across this repository when developing a Java application for visualising sorting algorithms and noticed a couple of discrepancies in the descriptions. Selection sort Best case is O(n² not O(n). Its performance is hardly reasonable, in fact it is the worst performer of its type. Bubble sort More useful than selection sort surely. Insertion sort I would say its operation is closer to the selection sort than the bubble sort.