Quick Sort Using Recursion (Theory + Complexity + Code)

Publicado em: 16 Outubro 2021
no canal de: Kunal Kushwaha

181,595

4.4k

In this video, we cover the quick sort algorithm. Including the theory, code implementation using recursion, space and time complexity analysis, along with comparison with merge sort. We also see how in-built sorting algorithms work.

Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!

👉 Resources
Join Replit: http://join.replit.com/kunal-kushwaha
Complete Java DSA playlist: • Java + DSA + Interview Preparation Co...
Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA...

➡️ Connect with me: http://kunalkushwaha.com

=========================================
Timestamps:
00:00 Introduction
03:01 What is Pivot?
04:43 Recursive Quick Sort
09:58 How to put pivot at correct position?
17:55 How to pick the pivot?
20:15 Complexity comparison of pivot positions
27:45 Important Notes
29:32 Hybrid Sorting Algorithms
31:49 Code for Quick Sort
39:12 Internal Sorting Algorithm
41:20 Outro

#sorting #placement #dsa #interviews

Nesta página do site você pode assistir ao vídeo on-line Quick Sort Using Recursion (Theory + Complexity + Code) duração hora minuto segundo em boa qualidade , que foi baixado pelo usuário Kunal Kushwaha 16 Outubro 2021, compartilhe o link com seus amigos e conhecidos, no youtube este vídeo já foi visto 181,595 vezes e gostou 4.4 mil espectadores. Boa visualização!

54,509

1 mil