@harshgamer6105
damn! this is by far the easiest tutorial on quick sort, others were making it too complex!, thanks greg!
@vihangasathish2081
This is the best...U saved my life
@SARABESHKANISHKARVAD
this is the easiest tutorial on quick sort I have seen
@TheMacher105
by counting sort you can define K = max(arr) - min(arr) + 1 , and with that you can also use it for negative numbers in the Array ;) Thanks for the nice Video!
@dayanaracastaneda9731
GREG. TYSM. YOU SAVED MY GRADE IN DATA STRUCTURES.
@alfinabu6485
@15:25 Greg says we can merge two sorted array in constant time but then proceed with traversing the sorted arrays . So wouldn't it be O(n) instead of O(1). Can anyone clarify this?
@creativeusername4400
thank you greg you deserve a million subs!
@boboddyb2217
For those wondering about negative numbers in counting sort: create a new variable "minn = min(arr)", then change "counts = [0] * (maxx + 1 - minn) and "for x in arr: counts[x-minn] += 1" finally "arr[i] = j+minn".
@Everafterbreak_
your content is incredible!
@isaackelly6121
Great video! He sounds like Casually Explained too lol
@aalexa1953
Are these sorting methods considered as Two Pointers?
@odhranjennings7585
2:46
@darknightdoomer7154
In the selection sort, shouldn't the outer loop be "for i in range(n-1)" instead of n? Because we don't need to do the last comparison since the last element will automatically be sorted. Also, the inner for loop at the last iteration will make the START (i+1) be 9, while the STOP (n) will be 8, resulting in an empty range that results in unnecessary swapping of the same elements at the end. Additionally, in the bubble sort, my implementation is different from yours but yours can be more efficient by adding a counter right? Like implement a counter next to the swapped variable, setting it to 0 at the moment. But for each while loop iteration, increment it by 1. This way, we can set the for loop into "for i in range(1, n-counter)", making the already sorted elements at the end not be checked anymore. Am I correct with my logic or am I wrong
@snigdhamajee2999
Loving your series. What IDE are you using?
@adm7r
i'm following algomap, but don't see a link to this video in any of the sections, why?
@produceutopia
Doesn't your implementation of quick sort use O(n log(n)) space as you are creating many new lists?
@kevinavi293
what software is he using to draw ?
@Vmv305
should we master all these algorithms for a coding interview?
@Everafterbreak_
are you drawing using the mouse? i need these skills. lmaooo
@GregHogg