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
@@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)
Master Data Structures & Algorithms For FREE at AlgoMap.io!
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
Thank you greg
damn! this is by far the easiest tutorial on quick sort, others were making it too complex!, thanks greg!
your content is incredible!
Thank you!
this is the easiest tutorial on quick sort I have seen
thank you greg you deserve a million subs!
Thank you! Trying my hardest to get there haha
@@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)
Nice!
i'm following algomap, but don't see a link to this video in any of the sections, why?
It's important theory, but not really that essential for most problems in my opinion
@@GregHoggmakes sense, thank you for the reply
❤
what is the use of i
It’s used as an index when iterating through the array,i is the conventional one but you can use any letter
Counting sort was overwhelming and overkill
Doesn't your implementation of quick sort use O(n log(n)) space as you are creating many new lists?
it only creates one additional list which he named it as counts
No, he creates a new R and L list each time and passes them down
Yes but not all are present at the same time
@@GregHogg So at most at one time, they will have O(n) space in total?
What about heap sort???
he has a separate video for heap data structure and it is pretty easy to understand
explain with user input list
What
are you drawing using the mouse? i need these skills. lmaooo