Quicksort

[derstreber2]

wow that was fast.

[pithikoulis]

how much time did it take him?

[akhil1987jain]

i think u are mad and cyco

[danielodors]

@akhil1987jain -lol, I think you meant "psycho" not "cyco".

[tramrunner]

it reminds me how I worked as a clerk

[kbae80]

haha you are awesome

[xcoderzach]

I don't think solving P=NP would let you sort in constant time :-/ Because sorting isn't an NP complete problem.

[j2n]

Nice. What's the song?

[mkadiri05]

i kinda understand quicksort now but one question... if you splitting them in numbers lets say from 0-100 would you put the first split 0-50 and put it on the left and 2nd 51-100 and put it on the right.

[whipster1000]

Nearly... the first element is the pivot, then the left stack/array is all the items less than the pivot and the right stack/array is all the items greater than the pivot, then you recursively repeat the process.

You can in fact pick any element to be the pivot, but using the first element is just convenient.

[jomomo]

depends on your pivot.

[DerKoerper1991]

:D nice!!!

[merolleiro]

AHHA...try stupidsort LOL

[malazt]

now do it in constant time

bet you cant.

[notToast]

if he could do that he would win 1 million dollars for solving P=NP

[malazt]

yeah, they should offer more for that.

[FreakForFreedom]

very cool

simple yet clear way to help understanding the quicksort

:)

[pxixpx8x]

wena urrutia!!

[ewanm89]

I want him to do it with heap sort...

[amarilia2003]

muito bom

[gurghet]

NONONO!!! U should have done this with selection sort!!!! Is faster when the cost of a comparation is way smaller than swirling sheets around!!

[VelocityTheory]

of course its a quick sort... your hands are moving fast... god

[joedebanana]

Sorting papers in O(N log N). What can be bater that this :D

[thomasvg1]

Extremely helpful for CompSci Students trying to figure this stuff out :)

[TvLatte]

Surely "list" of graded homeworks ;-)

[80amnesia]

lol very nice now do a mergesort :)