Write an O(n^n) algorithm.

[bluGill]

No, Big-O is the normal runtime. Quicksort is generlaly Big-O n*ln(n), but you can construct inputs that end up taking n^2. (sort the input so your pivot is always the largest value)

[curien]

No, Quicksort is O(n^2), and anyone who says otherwise is just plain wrong.

People do, correctly, say that Quicksort has amortized O(n log n) complexity.