Sorting: Bubble, Insertion, Selection, Merge, Quick, Counting Sort - DSA Course in Python Lecture 10

  Рет қаралды 9,015

Greg Hogg

Greg Hogg

Күн бұрын

Пікірлер: 26
@GregHogg
@GregHogg 4 ай бұрын
Master Data Structures & Algorithms For FREE at AlgoMap.io!
@venkateshk816
@venkateshk816 Күн бұрын
hey Greg so far you explained the nightmare of sorting(quicksort) very simply but it would be better to include the pivot elements with different positions like it is easy to do picking pivot at last or first but when considering the pivot at the middle element as a pivot i am getting little bit of confused in the part of list comprehension will you make a video of it or you can explain me in this chat
@SARABESHKANISHKARVAD
@SARABESHKANISHKARVAD 12 күн бұрын
this is the easiest tutorial on quick sort I have seen
@harshgamer6105
@harshgamer6105 4 ай бұрын
damn! this is by far the easiest tutorial on quick sort, others were making it too complex!, thanks greg!
@creativeusername4400
@creativeusername4400 4 ай бұрын
thank you greg you deserve a million subs!
@GregHogg
@GregHogg 4 ай бұрын
Thank you! Trying my hardest to get there haha
@amaliyaakopyan9200
@amaliyaakopyan9200 13 күн бұрын
@@GregHogg it is so pleasant to watch drawing how algorithm actually runs. this proper visualization makes understanding so much easier. btw, got count sort on my interview)
@Everafterbreak_
@Everafterbreak_ 2 ай бұрын
your content is incredible!
@GregHogg
@GregHogg 2 ай бұрын
Thank you!
@SpaceTalon
@SpaceTalon 4 ай бұрын
Nice!
@prashanthnellutla6681
@prashanthnellutla6681 Ай бұрын
Counting sort was overwhelming and overkill
@ashiyashaikh5275
@ashiyashaikh5275 4 ай бұрын
@adm7r
@adm7r 21 күн бұрын
i'm following algomap, but don't see a link to this video in any of the sections, why?
@GregHogg
@GregHogg 21 күн бұрын
It's important theory, but not really that essential for most problems in my opinion
@adm7r
@adm7r 21 күн бұрын
​@@GregHoggmakes sense, thank you for the reply
@RaghuPratap-of8xs
@RaghuPratap-of8xs 3 ай бұрын
what is the use of i
@produceutopia
@produceutopia 4 ай бұрын
Doesn't your implementation of quick sort use O(n log(n)) space as you are creating many new lists?
@fantastic-b2m
@fantastic-b2m 4 ай бұрын
it only creates one additional list which he named it as counts
@produceutopia
@produceutopia 4 ай бұрын
No, he creates a new R and L list each time and passes them down
@GregHogg
@GregHogg 4 ай бұрын
Yes but not all are present at the same time
@produceutopia
@produceutopia 4 ай бұрын
@@GregHogg So at most at one time, they will have O(n) space in total?
@Chandhu987
@Chandhu987 4 ай бұрын
explain with user input list
@GregHogg
@GregHogg 4 ай бұрын
What
@kleejensen8684
@kleejensen8684 2 ай бұрын
What about heap sort???
@Ganesh-lm5dx
@Ganesh-lm5dx Ай бұрын
he has a separate video for heap data structure and it is pretty easy to understand
@Everafterbreak_
@Everafterbreak_ 2 ай бұрын
are you drawing using the mouse? i need these skills. lmaooo
Real Man relocate to Remote Controlled Car 👨🏻➡️🚙🕹️ #builderc
00:24
МЕНЯ УКУСИЛ ПАУК #shorts
00:23
Паша Осадчий
Рет қаралды 5 МЛН
The Singing Challenge #joker #Harriet Quinn
00:35
佐助与鸣人
Рет қаралды 44 МЛН
Leetcode 46. Permutations : Introduction to backtracking
10:06
ComputerBread
Рет қаралды 104 М.
Top 7 Algorithms for Coding Interviews Explained SIMPLY
21:22
Codebagel
Рет қаралды 442 М.
Quick Sort Using Recursion (Theory + Complexity + Code)
42:14
Kunal Kushwaha
Рет қаралды 189 М.
Explaining EVERY Sorting Algorithm (part 1)
35:35
Kuvina Saydaki
Рет қаралды 174 М.
LeetCode was HARD until I Learned these 15 Patterns
13:00
Ashish Pratap Singh
Рет қаралды 577 М.
The LeetCode Fallacy
6:08
NeetCode
Рет қаралды 574 М.
Real Man relocate to Remote Controlled Car 👨🏻➡️🚙🕹️ #builderc
00:24