This lecture explains the details of the working of quick sort, which is on average 3 times faster than merge sort. The coding syntax is very general, fit for any language. The video has 3 parts: the first 20 minutes approximately, or first third, gives the explanation – watch that part of the lecture. You should watch the rest of the lecture when you study Big-O analysis.
Source: OpenCourseWare. https://www.youtube.com/watch?v=vK_q-C-kXhs
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 License.
Last modified: Monday, January 30, 2023, 7:46 PM