Re: QuickSort (worst-cases... special data)

Sem <semyazz@xxxxxxxxx> writes:

I see i forgot to write that i have to choose always middle element
and both sequences have bad timings, but V is much better than A...
but they are still O(n^2) but different... so again, what can cause it?

Have you tried profiling the code to see where the time is being
spent? If you have two cases that take different amounts of time, I
would think that they would have different execution profiles.
.