Quicksort 1 - The Algorithm

[@alenavass2]

You are honestly so good at explaining clearly while keeping it concise. Thank you!

[@ComputerScienceLessons]

Thanks for the lovely comment :)KD

[@0x1F600]

During my two years at A level we had a replacement teacher who wasn't able to teach us the more mathematical and algorithmic side of the course. Your videos have saved me just in time for my exams, thank you.

[@ComputerScienceLessons]

Delighted to help. Good luck :)KD

[@ThePandaGuitar]

Please keep teaching Kevin! This is KZbin gold!

[@abz7800]

OH my god this is the best explanation ever the other vids are so bad compared to this

[@ComputerScienceLessons]

Thank you :)KD

[@gregwoolley]

Excellent tutorial. Thank you!

[@yvbuzan7395]

thank you for this wonderful video. I like it very much.

[@smit17xp]

very easy to understand. thanks

[@ComputerScienceLessons]

You're welcome :)KD

[@prabhakarpalanivel6472]

Good one Kevin, one minor suggestion, in terms of coding it, its slightly vague. It might have been clearer if we keep swapping the values when array[L] > pivot and array[R] < pivot which i think was the original quick-sort algorithm (which evolved subsequently)

[@AmNotLegend]

maybe not exactly correct, 9:15 Data[LeftPointer]=Data[RightPointer]; then losing the data[LeftPointer]

[@rollyrodrigz5069]

Mr, awesome tutorials. Would you like to make videos solving algorithms problems?. For example algorithms from hackerrank.

[@ComputerScienceLessons]

I Rolly. Thanks for the comment. I'll certainly take a look at Hackerrank.

[@jtlunsford780]

How many items to sort, where QuickSort becomes more efficient than Bubble and Insertion? It's a good sort, but I can see, or at least I think I see an easier way. I'd have to play with it and I'm sure I'm not the first to think that. Anyway, on to the next vid and you make it so simple, but I'm still going to mull the pseudocode over in my tiny little brain...LOL Thanks so much for all this learning opportunity you provide. I always read the comments, and everyone agrees, U Da Man....JT

[@ComputerScienceLessons]

Once you've learned a few sorting algorithms, take a look at Big O. It's a way describing how well an algorithm scales. For example, a bubble sort is good for small amounts of data but slows down significantly if your double the amount of data it has to handle. On the other hand, something like the merge sort doesn't get much slower when you double the amount of data it has to handle. :)KD

[@yumeiluo330]

Great one!!!!

[@veliamomo6561]

why double scanner pointer