Nice explanation - just to add, the worse case scenario of n^2 can be avoided by randomizing the position of the pivot on each go. This will result in nlog(n) in a worse case scenario.
I like your accent and the pacing of the material is very good, and also extremely clear!! I've got a data structures final tomorrow, and this helps immensely!
Thank you. 'Quick' but good presentation of 'Quick Sort' algo.
lvnsuresh1 2 months ago
bakwaas !!
nikhiljain103 3 months ago
Singaporean?
lhyx1990 4 months ago
@lhyx1990
Yep!
lcc0612 4 months ago
This has been flagged as spam show
@lcc0612 lol, it's weird to hear "algoREEEEthm". great tutorial tho
lhyx1990 4 months ago
@lhyx1990 lol, it's weird to hear "algoREEEEthm". great tutorial tho
lhyx1990 4 months ago
I like the high speed demonstration ;)
theempire00 5 months ago
Wonderful video. Better explained than my tutor :)
ZeF2007inc 10 months ago
@ZeF2007inc
Cheers! Glad I could be of help! =)
lcc0612 10 months ago
thank u man. this series is great.
aty1362 10 months ago
@aty1362
Cheers! Glad I've been a help
lcc0612 10 months ago
Nice explanation - just to add, the worse case scenario of n^2 can be avoided by randomizing the position of the pivot on each go. This will result in nlog(n) in a worse case scenario.
fervidnerd 1 year ago
@fervidnerd
Sweet! Thanks for the info!
lcc0612 1 year ago
Pretty well explained.
Par5Birdie 1 year ago
Thank you very much!
I like your accent and the pacing of the material is very good, and also extremely clear!! I've got a data structures final tomorrow, and this helps immensely!
Ms4dmin 1 year ago
@Ms4dmin
Hi! Glad I could be of help! All the best for your exams!
lcc0612 1 year ago
You're awesome, man!
margibs 1 year ago
cool
margibs 1 year ago
cool videos
Basicpiviot 1 year ago
Thanks!
koenrouwhorst 1 year ago