I know this is more of a stack overflow question I know, but unfortunately my question got ignored there.
http://pastebin.com/Ccv4KP3j
I have to create and implement a quick sort and for some reason it just returns an array in the same order.
what language?
>>16852186
English
>>16852186
C, sorry.
>>16852194
if i wasnt blackout drunk i would throw this into netbeans and try and figure it out. sorry, i dont know C that well either way. try 420chans /prog/ board they're pretty helpful. good luck anon
Step through the code. Alternatively print every time you find a swap to make. You can also try with smaller cases. >>>/g/dpt is fairly helpful when they're not arguing about i++ vs ++i
>>16852217
Wait a sec this is fairly obvious. Look at when you swap. You only swap after the for loop is done. That's not how I remember quicksort
>>16852222
Nevermind. Too drunk.
