Quick Sort may or may not recursively divide its sublists evenly.

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