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

[@GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[@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

[@dolamuoludare4383]

Thank you greg

[@harshgamer6105]

damn! this is by far the easiest tutorial on quick sort, others were making it too complex!, thanks greg!

[@SARABESHKANISHKARVAD]

this is the easiest tutorial on quick sort I have seen

[@Everafterbreak_]

your content is incredible!

[@GregHogg]

Thank you!

[@adm7r]

i'm following algomap, but don't see a link to this video in any of the sections, why?

[@GregHogg]

It's important theory, but not really that essential for most problems in my opinion

[@adm7r]

​@@GregHoggmakes sense, thank you for the reply

[@creativeusername4400]

thank you greg you deserve a million subs!

[@GregHogg]

Thank you! Trying my hardest to get there haha

[@amaliyaakopyan9200]

@@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)

[@RaghuPratap-of8xs]

what is the use of i

[@sayyidmogaka6754]

It’s used as an index when iterating through the array,i is the conventional one but you can use any letter

[@SpaceTalon]

Nice!

[@prashanthnellutla6681]

Counting sort was overwhelming and overkill

[@produceutopia]

Doesn't your implementation of quick sort use O(n log(n)) space as you are creating many new lists?

[@fantastic-b2m]

it only creates one additional list which he named it as counts

[@produceutopia]

No, he creates a new R and L list each time and passes them down

[@GregHogg]

Yes but not all are present at the same time

[@produceutopia]

@@GregHogg So at most at one time, they will have O(n) space in total?

[@kleejensen8684]

What about heap sort???

[@Ganesh-lm5dx]

he has a separate video for heap data structure and it is pretty easy to understand

[@Chandhu987]

explain with user input list

[@GregHogg]

What

[@ashiyashaikh5275]

❤

[@Everafterbreak_]

are you drawing using the mouse? i need these skills. lmaooo