That depends on the pivot chosen. If your quicksort implementation actually hits n^2 behavior with sorted input, it's probably not the best implementation.
Any implementation can hit n^2 with random input. It's just highly unlikely.
Any implementation can hit n^2 with random input. It's just highly unlikely.
It's feasible to maintain. But people might rely on it, too. As a random example (and easily avoidable example), quicksort works with random input, but 'breaks' for pre-sorted input.