Quicksort Question

#1

All test cases have passed using https://ide.codingblocks.com/s/55203
I am curious as to why one test case didn’t pass using https://ide.codingblocks.com/s/55202 and why did that test case show TLE with https://ide.codingblocks.com/s/55206

#2

Plz send your code for which your code is showing TLE,

#3

Please see https://ide.codingblocks.com/s/55202 and https://ide.codingblocks.com/s/55206 1

#4

Basically in one of the code, in shuffle function you have used
for (int i=0; i<v.size(); i++)
whereas in other you have used
for (int i=0; i<v.size()-1; i++)

The TLE in one case is because of this only, this is because quick sort is having worst case complexity when array is totally reversed, and when u used shuffle function, you are randomly sort elements and then apply the normal quicksort function, and because of this reason only you are getting TLE.