#computer Science

#python

#Big O for quicksort

Q1)Select what the Big-O notation for Quick Sort's partition function is (where n is the number of elements in the list).?

Q2)Select what the Big-O notation for Quick Sort's running time is (where n is the number of elements in the list) if the sublists are evenly split.

O(1)

O(log n)

O(n)

O(n log n)

O(n^2)

O(n!)