Loading...
Loading...
OPERATIONS
[1]0
ops.
SWAPS
[2]0
ops.
GETS
0
ops.
SETS
0
ops.
COMPARISONS
0
comp.
REAL TIME
0
ms
VISUAL TIME
0
sec
OPS PER MS
0
ops/ms
COMPS PER MS
0
comp/ms
[1] Sum of Swap, Get, Set and Comparison operations.
[2] Swap operations do not count as neither Get nor Set operations.
Cocktail shaker Sort
Quick sort is a comparison sort that is efficient on average. It is a divide and conquer algorithm that works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting.
Read moreThere are many different versions of quicksort that pick pivot in different ways. The choice of pivot can make a big difference in the performance of quicksort.
| Big O Notation | |||
|---|---|---|---|
| Time complexity | Space complexity | ||
| Worst | Average | Best | Worst |
| O(n^2) | Θ(nlog n) | Ω(nlog n) | O(log n) |
Big O Notation defines the lower, average and upper bounds of an algorithm, where Time complexity determines the amount of operations, and Space complexity the amount of memory that can be used
