Quick Sort Complete Explanation and Implementation | Data Structures and Algorithms
HTML-код
- Опубликовано: 30 июл 2024
- Detailed Explanation of Quick Sort with code building and complexity analysis.
00:00:00 - Intuition behind Quick Sort
00:05:03 - Building Code Logic
00:24:25 - Running and Debugging
00:35:13 - Space Complexity
00:37:48 - Time Complexity
00:42:36 - Is Quick Sort Stable?
00:43:17 - Which Pivot is better?
#DataStructures #Algorithms #DSA #DS #DSALGO
CodeLink - github.com/LogicFirstTamil
DS and ALGO in C/CPP: • Introduction to Data S...
DS and ALGO in Java: • Introduction to Data S...
Java Playlist: • Learn Java in Tamil
Java one video: • Java Full Course in Ta...
C Interview program playlist: • C Interview Programs i...
C programming in one video: • C Programming in Tamil...
C programming playlist: • Introduction to C prog...
C++ Playlist link: • C++ Programming in Tamil
English channel link: / @logicfirst31
you are really serving !! you must have a great future in teaching !! such a wonderful explanation without any confusions !! Thanks a ton !!
great work mam ! Continue posting DSA and problem solving videos in Java !
sure bro. pls share with ur friends and help me reach more students.
am really saying, this is the best explanation for quick sort. Understood each and every step. Thanks for this video...
Data structure pls neraiya concept algorithm base Pani video podunga mam unga videoa matumtha nala understand pana mudiuthu mam so neraiya concept base Pani podunga
Sure. I will do. Pls share with your friends.
Very nice, clear and detailed explanation mam. 😃👍. . Thanks for the efforts. .
Thank you madam, I planned to learn quick sort today. You also uploaded video thank you so much...... ,❤️❤️♥️
Thanks for your hardwork mam!! 🙏
Madam, are you developer / professor? You are feeding a logic words by words super madam.....
very good Explantion mam
Mam needed to know about recursion relation time complexity please give a try to upload that mam✌
Super teacher 😇✌️
Super akka
Mam, Reccurence Relations pathi Vide podunga. Please
mam 29.25min la high value = -1 thana varum but high =1 nu iruku nama high = end thana vacherukom(para meter la) so high = -1 thana varanum
32:49 ultimate 😃after learning all sort
❤❤
In 34:48 i can't get that question.Can you explain what question is?
It show stack overflow exception
Mam DBMS video poduga plzzzz 🙏
Mam ennaku first pass la [4,1,2,5,3] in tha array la "2" Pivot ah eduthan but 2 correct aana position la varala [2,1,4,5,3] ipdi varuthu
program debugging or dry run? either way some mistake on ur side
yes u are right, you will end up with [2,1,4,5,3] but you need to proceed further to the next recursion step, where this array will be split as [2,1][low=0, end=1] and [4,5,3] [start=2, high = 4], in that step the order gets arranged properly. for example for the first half [2,1], the pivot will be 2 (mid =0), so quick sort will shuffle it. In the second half [4,5,3] pivot will be 5 (mid = 3), again quick sort will sort it to proper places. Hope this helps.
@@saieswariamaran9003 thank you bro... ☺😇
Mam git-hub le code eruka
Recursion relation venum ka
Dsa mudinchuta illa innum irukka?
neraya iruku
Binary search and sort methods code ella
I will add bro
Ok
Mam neenga yena job poringa lecture ah mam
I am not working currently sister.
Python ?
I have already uploaded. ruclips.net/video/BiDOehqG68g/видео.html
your coding have error!