@@ -229,14 +229,14 @@ Below is the list of some of the most used Big O notations and their performance
229229
230230###Array Sorting Algorithms Complexity
231231
232- | Name| Best| Average| Worst| Memory| Stable| Comments|
233- | ---------------------| :-------:| :-------:| :-----------:| :-------:| :-------:| :--------|
234- | ** Bubble sort** | n| n<sup >2</sup >| n<sup >2</sup >| 1| Yes| |
235- | ** Insertion sort** | n| n<sup >2</sup >| n<sup >2</sup >| 1| Yes| |
236- | ** Selection sort** | n<sup >2</sup >| n<sup >2</sup >| n<sup >2</sup >| 1| No| |
237- | ** Heap sort** | n log(n)| n log(n)| n log(n)| 1| No| |
238- | ** Merge sort** | n log(n)| n log(n)| n log(n)| n| Yes| |
239- | ** Quick sort** | n log(n)| n log(n)| n<sup >2</sup >| log(n)| No| |
240- | ** Shell sort** | n log(n)| depends on gap sequence| n (log(n))<sup >2</sup >| 1| No| |
241- | ** Counting sort** | n + r| n + r| n + r| n + r| Yes| r - biggest number in array|
242- | ** Radix sort** | n * k| n * k| n * k| n + k| Yes| k - length of longest key|
232+ | Name| Best| Average| Worst| Memory| Stable| Comments|
233+ | ---------------------| :------------- :| :----------------- :| :------ -----------:| :-------:| :-------:| :--------|
234+ | ** Bubble sort** | n| n<sup >2</sup >| n<sup >2</sup >| 1| Yes| |
235+ | ** Insertion sort** | n| n<sup >2</sup >| n<sup >2</sup >| 1| Yes| |
236+ | ** Selection sort** | n<sup >2</sup >| n<sup >2</sup >| n<sup >2</sup >| 1| No| |
237+ | ** Heap sort** | n log(n)| n log(n)| n log(n)| 1| No| |
238+ | ** Merge sort** | n log(n)| n log(n)| n log(n)| n| Yes| |
239+ | ** Quick sort** | n log(n)| n log(n)| n<sup >2</sup >| log(n)| No| |
240+ | ** Shell sort** | n log(n)| depends on gap sequence| n (log(n))<sup >2</sup >| 1| No| |
241+ | ** Counting sort** | n + r| n + r| n + r| n + r| Yes| r - biggest number in array|
242+ | ** Radix sort** | n * k| n * k| n * k| n + k| Yes| k - length of longest key|