Quick sort - mmedrano9438/peripheral-brain GitHub Wiki

The best-case time complexity of quicksort is O(n*logn). Average Case Complexity - It occurs when the array elements are in jumbled order that is not properly ascending and not properly descending.