Quick Sort Complete Explanation and Implementation | Data Structures and Algorithms

preview_player
Показать описание
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

Рекомендации по теме
Комментарии
Автор

am really saying, this is the best explanation for quick sort. Understood each and every step. Thanks for this video...

kousikraj
Автор

youtube has made learning so much reachable for almost everyone who has interest !!

rajeshr
Автор

you are really serving !! you must have a great future in teaching !! such a wonderful explanation without any confusions !! Thanks a ton !!

arulprakasan
Автор

great work mam ! Continue posting DSA and problem solving videos in Java !

shrinaths
Автор

Thank you madam, I planned to learn quick sort today. You also uploaded video thank you so, ❤️❤️♥️

suryam_
Автор

Very nice, clear and detailed explanation mam. 😃👍. . Thanks for the efforts. .

resh
Автор

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

meenavinoth
Автор

Madam, are you developer / professor? You are feeding a logic words by words super

suryam_
Автор

It is excellent! Could you please upload more videos on new topics?

abdtrades
Автор

Supera puriuthu thank u what do you do sis
How did u learn perfectly
Who taught u
From where u got such a clear knowledge
Amazing sister
Very jealous of u

mathsmanju
Автор

good video, thank you for this. It would be great if you provide the code separately for reference.

ashwiv
Автор

Mam needed to know about recursion relation time complexity please give a try to upload that mam✌

sanjaymuthulakshmi
Автор

32:49 ultimate 😃after learning all sort

krishnaveeran
Автор

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

krishnamoorthi
Автор

In 34:48 i can't get that question.Can you explain what question is?

tomfred
Автор

Without code snippet its hard to understand.
I couldn't find the QuickSort code in your Github. Please add.

shankarraj
Автор

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

rahim
Автор

Binary search and sort methods code ella

TamilMasterCreations
Автор

Mam neenga yena job poringa lecture ah mam

meenavinoth
welcome to shbcf.ru