File tree Expand file tree Collapse file tree 1 file changed +4
-4
lines changed Expand file tree Collapse file tree 1 file changed +4
-4
lines changed Original file line number Diff line number Diff line change @@ -234,9 +234,9 @@ Below is the list of some of the most used Big O notations and their performance
234234| ** Bubble sort** | n | n<sup >2</sup > | n<sup >2</sup > | 1 | Yes | |
235235| ** Insertion sort** | n | n<sup >2</sup > | n<sup >2</sup > | 1 | Yes | |
236236| ** 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 | |
237+ | ** Heap sort** | n& nbsp ; | n& nbsp ; | n& nbsp ; | 1 | No | |
238+ | ** Merge sort** | n& nbsp ; | n& nbsp ; | n& nbsp ; | n | Yes | |
239+ | ** Quick sort** | n& nbsp ; | n& nbsp ; | n<sup >2</sup > | log(n) | No | |
240+ | ** Shell sort** | n& nbsp ; | depends on gap sequence | n& nbsp ; sup >2</sup > | 1 | No | |
241241| ** Counting sort** | n + r | n + r | n + r | n + r | Yes | r - biggest number in array |
242242| ** Radix sort** | n * k | n * k | n * k | n + k | Yes | k - length of longest key |
You can’t perform that action at this time.
0 commit comments