Quicksort Algorithm Implementation | C Programming Example

[ycee]

I just love how calmly he explains the code without explain anything unnecessary which makes it really easy to understand .

[nooenewillbespared]

Hi Kevin,


Not only your voice is damn soothing but this was probably the best quicksort explanation and discussion I have ever seen in C and I have been programming for the last 18 years in C, C++, Java and Python 🙂 I have been on Youtube as well since 2007.
And just a followup question, would you like to teach maybe about operating systems(Linux), Linux kernel, Computer Architecture, system programming, administration, networking and distributed systems and debugging with gdb, valgrind and maybe later cloud computing and applications. I know this is asking for the whole career maybe but you can do it.

I feel that you would do a really, really great job in doing that. There are only a few people who can really put their points across and it becomes clear to students and professionals alike.

Kind regards,
skg

[burkayelbir]

Love your videos man, you explaining everything one by one, i am glad i found this channel, thank you.

[meanup]

Thank you so much. Initially I was struggling with the partition implementation but you make it clear.

[dieterbohm]

Thank you so much bro! You make look this algorithms like a walk in the park! Your explanations are so good :)

[nicoloasjosse]

I needed to sort an array and move elements of others arrays conforming to order to the first array. Your crystal clear vidéo was a great help for me. Thank you sir, you got a new subscriber.

[kornelodri]

Nice topic, nice explanation. Keep up in this direction.

[idanmariani]

your awsome..every video you make just make everything super clear.. thank you!!!! :)

[naboulsikhalid]

when the code is explained, the picture is very clear. But my issue, how myself can think like the way it is explained. and there, where I got stuck all the time. I mean the thinking problem. Thank you for the effort deployed from your side to bring knowledge to us with simple way.

[wisdomokafor]

Thanks for the video so much. You really broke it down to the bear minimum

[gunjanagarwala]

Thank you so much..after watching your explanation quick sort was crystal clear to me..

[krishnabhagavankarri]

Best explanation i could get in youtube

[sofiahuppertz]

Thank you very much for your videos! They have helped me a lot all along the way in learning C.

[netanelkomm]

Thanks, this is awesome. Just what I needed.

[WorstDraven]

Good structure and very understandable. Thank you ❤

[MrJzvoyeur]

Testing sorting algorithms from this playlist
(videos 36, 44, 73, 121, 126) on a raspberry-pi 4,
measure-function from video 244, length of sort-array:
> quick-sort: 0.086109 sec (on my other computers quick-sort is faster than merge-sort)
> merge-sort: 0.045641 sec
> insertion-sort: 23.990210 sec
> selection-sort: 29.300313 sec
> bubble-sort: 74.007234 sec

[evgeniifeygin]

Thanks a lot. But I agree with the previous point that indexes in C must be of size_t type. Then, let us imagine we have an array [3] = {3, 3, 1}, and we have no random pivot var. Pivot == 1, and in the end of the partition function we return index 0. Calling recursievly quicksort_recursion function with ''pivot_index - 1, we receive : 0 -1 == 77737182319123178 " ( because pivot index is size_t)

[fifaham]

@10:28 isn't that supposed to be J ? Nice algorithm. Thank you.

[gabiedubin]

if you're wonder why your code doesn't work when you did exactly what this guy did, check if you're returning the end of all of the lower values in partitition and not the pointer to the divider.

[cirobermudez]

To generate random number between low and high the equation is
A) rand() % (high + 1 - low) + low
so is it ok to use rand() % (high + 1 - low) ?

Love the way you explained, your tutorials are amazing.