Quicksort algorithm

26
2



See complete series on sorting algorithms here:

In this lesson, we have explained Quick sort algorithm and implemented it in C++. Quick sort is a divide and conquer algorithm that has an average case time complexity of O(nlogn).

For more such videos and updates, subscribe to our channel.
You may also like us on facebook:

Quicksort (Algorithm), Algorithm (Mathematical Concept), college, software, hiring, classes, courses, School, University, training, java, c++, interview, job, jobs, programming, coding, my code school, quick sort, quicksort, yt:cc=on

Xem Thêm Bài Viết Về Mobile Khác: https://sealsystem.org/mobile

Nguồn: https://sealsystem.org/

26 COMMENTS

  1. That was a great explanation.
    Inspired by your content I created a video with some animations and visuals. Quick Sort can be fun 😀
    Check it out here https://youtu.be/2SRzQEOaLYw

  2. Small correction for 12:21 – the call made is Q(A, 0, 0) this corresponds to A(start, pivot-1) where pivot in this case is 1 therefore 1-1 = 0 and thus the sentinel still holds since start < end is False: 0 !< 0 it is equal therefore we won't execute but we'll simply return.

LEAVE A REPLY

Please enter your comment!
Please enter your name here