Sorting algorithms and their big O’s

Worst Case 
Best Case 
Average Case 
O(n^{2}) 
O(n) 
O(n^{2}) 

O(n^{2}) 
O(n) 
O(n^{2}) 

O(n²) 
O(n²) 
O(n²) 

O(nlogn) 
O(nlogn) 
O(nlogn) 

O(n^{2}) 
O(nlogn) 
O(nlogn) 
From Wikipedia:
The algorithm works as follows:
 Find the minimum value in the list
 Swap it with the value in the first position
 Repeat the steps above for the remainder of the list (starting at the second position and advancing each time)
Effectively, the list is divided into two parts: the sublist of items already sorted, which is built up from left to right and is found at the beginning, and the sublist of items remaining to be sorted, occupying the remainder of the array.
Amiable dispatch and this fill someone in on helped me alot in my college assignement. Say thank you you on your information.