How to construct an array to make qsort() having n^2 time complexity?
I heard a long time ago that the implementation of the qsort function is the quick sorting algorithm and has a worst-case time complexity of n^2. But recently when I was trying to construct a set of data that would allow the qsort function to time out, I discovered that its implementation is not exactly