Man I’m so glad that you decided to continue these series. I love these series. So educational and so simple unlike other textbooks. Please keep these going. Thanks YK.
Brother PLEASE HELP !!!!!!!! i have my admob ac and my elder brother have him different admob ac .So,i want upload my apps on my brother`s play account .Means two admob in same play account .Is it illegal ?
I compared this implementation to the one used by Gayle Laakman McDowell in her Quicksort video (by calculating the number of passes of each implementation) and found this approach to be slightly more efficient using arrays with all duplicates, some duplicates and no duplicates. Since in both cases the selection of the pivot is somewhat random, I deduced that the placement of the pivot in the middle (5:30) of the two regions contributed to this slight improvement. UPDATE: What I mean with the relocation of the pivot, is that Gayle's approach picks the middle index as the pivot before swapping values rather than setting the pivot to the middle after the swap.
Yesterday Only (After Watching Big O Notation) I was going to comment and ask you to resume DS&A...Thanx man for this...and Plz Never Stop this DS&A series...I love the way you explain things 💓
This explanation is so good that i wanna cry...i've watched tons of videos of quicksort and still confused. But after watching the overview explanation, not even the pseudocode yet, i'm able to code it out correctly! THANK YOU!
I understood how quicksort works, but implementing it was another challenge: it was complicated and easy to make mistakes if we use the approach where the left and right pointers converge to the middle. The approach in this video is much easier to implement, but I couldn't understand it until I found this video. Thanks a lot!
Plz upload new video ... are you alright .... I think something has happened to you ... Get well soon and uplaod a new video ... Really missing you ...
Love from Brazil! My name is Diego and i really love the CS Dojo lessons...even with this huge amount of knowlegment He is able to teach everything in the way We can understand!
you are such a cute person and such a lovely teacher we all are blessed to have you i started watching this channel since 2 days and i saw your why i left google video and i just felt like awwww..... dont worry youtube will also give you a pretty handsome amount of money after a little time .......god bless you
such great job, your video is strongly recommended by our lecturer. And for the buddies who still don't get head around it, I would say go grab a pen and a paper, write it down and it becomes so much clearer.
Hey ,YK. i just want to say you are making the world a better place.thank you. love from Bangladesh.may god bless you.Could you make videos on How to get started with competitive programming?
Having a structuring system is the first step in getting organized . Then use some tools like #NOTION . Them improve your system as you go... . Nothing is perfect but we get gradual improvements on our way to EXCELLENCE! Thanks for explaining this in a way everyone can understand!
A good topic for a vlog could be how to create a real-time notification system. Which language and database is the best for this purpose. Another idea could be an example of your assignments at your work place. Also thank you for you vides, I have been watching them from the beginning of your channel.
I just came from the Binary Search video a couple days ago thinking "I wonder if he has a video on quicksort" Couldn't find any and then low and behold here we are xD
alist = [15,6,13,22,3,52,2] print("Original list is :" , alist) for i in range(1,len(alist)): key=alist[i] j=i-1 while j>=0 and key < alist[j]: alist[j+1] = alist[j] j=j-1 else: alist[j+1] = key print("List after sorting :",alist) will tis work
Could have explained in detail how the partition function ends off and meets the if loop condition, i.e p-=1 each time the function is called till l=r=p-1
I have been following your videos since you started. Your videos are so much useful for me than many. I am looking for system design videos. Please make system design videos.
Thank you so much for your hard work!!!! Your vids are so helpful, and helped me understand better than most other people have. Also, i watched most of your videos and i wanted to say i really appreciate your sense of humour and the jokes, they make you even more enjoyable to learn from :)
Nice one, I like the way you explain man, simple and clear. Can you also share which tools you use to create such simple but interactive videos? I am thinking to do the same for Java on our Javarevisited channel. I would appreciate your help.
Judging by the comments, I might be alone in this, but I found the explanation in this video to be really confusing. Why begin from the middle? And how do you pick the pivot in the first place?
Hey CS Can you suggest me some Websites or online platforms (Free) for practicing Logical Reasoning / Aptitude kinda stuff for interviews & Entrance Exam's. I know books are the best for these subjects but i want some start experience you know just kinda used to it. After that I'd love to opt for books.
Awesome explanation, the best teacher i never had. Please make a video about defining the time complexity of an algorithm, i have no ideia how to define this. (Not from us, i don't take physics and these tipe of class in school)
Its very helpful and easy to understand.i have a question about the sample code, i have implemented the quick sort code, but it didn’t work out. I don’t know what’s the problems on it :(
This channel is amazing. Thank you for such a great content. Can anybody please recommend a good course for Python that would give a certificate and teach you everything?
thank you foe sowing us also i am watching you vids on python on the 4 vid rn and i just want to say thank you so much for making these vids to help you fans or just people keep up the good work
I love how you hide all the code to avoid overwhelming
@Maddox Ronin instablaster ;)
Me too! It makes it so much easier to understand! Thank you CSDojo!
Man I’m so glad that you decided to continue these series. I love these series. So educational and so simple unlike other textbooks. Please keep these going. Thanks YK.
Sometimes he knowingly makes mistake to teach how to deal with it. Salute to him
that's actually a great way to teach, it provokes your mind to learn more.
Most great teachers do it, he's really good.
Brother PLEASE HELP !!!!!!!!
i have my admob ac and my elder brother have him different admob ac .So,i want upload my apps on my brother`s play account .Means two admob in same play account .Is it illegal ?
@@alexjr977 I don't have any idea about it.
@@gyantime8928 So fast! Ok,but thank you for reply
I love the way u teach.
Pls continue this series...
I compared this implementation to the one used by Gayle Laakman McDowell in her Quicksort video (by calculating the number of passes of each implementation) and found this approach to be slightly more efficient using arrays with all duplicates, some duplicates and no duplicates. Since in both cases the selection of the pivot is somewhat random, I deduced that the placement of the pivot in the middle (5:30) of the two regions contributed to this slight improvement.
UPDATE: What I mean with the relocation of the pivot, is that Gayle's approach picks the middle index as the pivot before swapping values rather than setting the pivot to the middle after the swap.
Yesterday Only (After Watching Big O Notation) I was going to comment and ask you to resume DS&A...Thanx man for this...and Plz Never Stop this DS&A series...I love the way you explain things 💓
yep ikr?
Please complete all the other datastructures, we are waiting for that
This explanation is so good that i wanna cry...i've watched tons of videos of quicksort and still confused. But after watching the overview explanation, not even the pseudocode yet, i'm able to code it out correctly! THANK YOU!
I agree, This was my fifth video instructor. I got my code working during the psudocode!
Please continue to make data structures and algorithms simple. Among all the videos I watched this has the best explanation.
CS Dojo, the visuals in this video are great!
yesss! I needed to see the visuals explained alongside the code like this. Thank youu!! ily
I understood how quicksort works, but implementing it was another challenge: it was complicated and easy to make mistakes if we use the approach where the left and right pointers converge to the middle. The approach in this video is much easier to implement, but I couldn't understand it until I found this video. Thanks a lot!
Thank you for all the efforts to make it look very simple and practical
Plz upload new video ... are you alright .... I think something has happened to you ... Get well soon and uplaod a new video ... Really missing you ...
Love from Brazil! My name is Diego and i really love the CS Dojo lessons...even with this huge amount of knowlegment He is able to teach everything in the way We can understand!
you are such a cute person and such a lovely teacher we all are blessed to have you i started watching this channel since 2 days and i saw your why i left google video and i just felt like awwww..... dont worry youtube will also give you a pretty handsome amount of money after a little time .......god bless you
this video helped me so much! Thanks from Brasil 🇧🇷🇧🇷🇧🇷🇧🇷
Thank you CS Dojo! Very well explained!
Cs dojo is realy one of my best subscribed chanels
Such a great video. Finally, I understand why the time complexity of quick sort is O(n log(n)).
Thank you for this update .... I was looking forward for this.. keep inspiring
No nonsense just code
Cs dojo🙏.
such great job, your video is strongly recommended by our lecturer. And for the buddies who still don't get head around it, I would say go grab a pen and a paper, write it down and it becomes so much clearer.
The best quicksort video I've ever seen. Thank you very much!
Please continue to do this great job. You are teaching so creatively. ❤️
Hey ,YK. i just want to say you are making the world a better place.thank you. love from Bangladesh.may god bless you.Could you make videos on How to get started with competitive programming?
Not sure if I can anytime soon, but I'll add it to my list :)
@@CSDojo Thank you.Have a great day Sir.
That's really amazing. I love it. Watching from Ghana🇬🇭
This was amazing.
Brilliant, I'll check my comment again after I watched and implemented all your videos and even when I'm a good programmer.
my man cs dojo the literal god.
Special thanks to you for opening my eyes to a better world of programming
Having a structuring system is the first step in getting organized
.
Then use some tools like #NOTION
.
Them improve your system as you go...
.
Nothing is perfect but we get gradual improvements on our way to EXCELLENCE!
Thanks for explaining this in a way everyone can understand!
Yea, everyone should have the basics of coding to become a productive person [IMHO]
You explain the complex problem in the simplest way possible 🙏✨
from u i am able to learn coding thx love u
This is perfect brother. I don't have any money but I will support as soon as I can. Thank you very much @CS Dojo
Thank you for putting this series together, it's been an absolute life saver!!
Man, your channel is a treasure!
Best video on quicksort💯
Please provide Full course on C++ coz your. the BEST
A good topic for a vlog could be how to create a real-time notification system. Which language and database is the best for this purpose. Another idea could be an example of your assignments at your work place. Also thank you for you vides, I have been watching them from the beginning of your channel.
I just came from the Binary Search video a couple days ago thinking "I wonder if he has a video on quicksort" Couldn't find any and then low and behold here we are xD
Man, you're my savior!
Thank you so much for the most complete and well presented explanation I have come across so far!
Thank you please continue this series. Your explanations are very good.
Thank you so much for this amazing explanation ❤
thanks for this great vid, this series will last for the next generation and it will value all the time
YK, you are welcome to make a video about Quicksort 'Magnetica'.
I have a question why do you return index of pivot?
That was the best code explanation I have ever seen. Thanks bro!
alist = [15,6,13,22,3,52,2]
print("Original list is :" , alist)
for i in range(1,len(alist)):
key=alist[i]
j=i-1
while j>=0 and key < alist[j]:
alist[j+1] = alist[j]
j=j-1
else:
alist[j+1] = key
print("List after sorting :",alist)
will tis work
Could have explained in detail how the partition function ends off and meets the if loop condition, i.e p-=1 each time the function is called till l=r=p-1
Your super better ever teacher of me in you tube........
Thank you for the video mr dojo
Thanks for the comprehensive explanation.
Thanks for making me learn python and coding! Happy coding , Thanks for making these videos
Glad to have YK as my Teacher !
You made quick sort like for a loop lol. Amazing explanation
.
Great dude. Clear explanation
You are great guy. What should we accompish by this video ? What is the point?
Keep these videos going, they are extremely helpful!
I have been following your videos since you started. Your videos are so much useful for me than many. I am looking for system design videos. Please make system design videos.
Thank you so much for your hard work!!!! Your vids are so helpful, and helped me understand better than most other people have. Also, i watched most of your videos and i wanted to say i really appreciate your sense of humour and the jokes, they make you even more enjoyable to learn from :)
Thanks bro
Please continue it
Great video afs always. You have a gift for explaining! I SUCK at figuring out Big O.
Thanks for all the help!
Awesome keep going with more data structures and algorithms tutorials...eagerly waiting for future upcoming videos
I'm so grateful for these videos, thank you mate!
God bless you!
Nice one, I like the way you explain man, simple and clear. Can you also share which tools you use to create such simple but interactive videos? I am thinking to do the same for Java on our Javarevisited channel. I would appreciate your help.
I talk about it here: www.csdojo.io/faq
@@CSDojo thank for quick reply, this mean the black screen where you are displaying code is generated using Wacom Tablet?
When will you return to youtube
Shouldn't time complexity of worst case be n(n+1)? Since qs(arr,p+1,r) will be recursed too
I've been waiting for this new episode of your series thank so much for uploading
My two favourite channels are CS Dojo and Alex Lee.
Very good quicksort explanation, keep up the good work!
hey . the 2 shifts keyboard don't run on my pc
, so please i want a solution of this problem .
Judging by the comments, I might be alone in this, but I found the explanation in this video to be really confusing.
Why begin from the middle?
And how do you pick the pivot in the first place?
@CS Dojo how do you know that there are log (n) levels for the time complexity of the best case for quick sort?
Glad to have you back. Hope you're doing well!
Hey CS Can you suggest me some Websites or online platforms (Free) for practicing Logical Reasoning / Aptitude kinda stuff for interviews & Entrance Exam's. I know books are the best for these subjects but i want some start experience you know just kinda used to it. After that I'd love to opt for books.
brilliant.org
@@pranav288 thanks buddy ! Appreciate you
@@xABHiiNAVx no prob mate good luck !
Awesome explanation, the best teacher i never had. Please make a video about defining the time complexity of an algorithm, i have no ideia how to define this. (Not from us, i don't take physics and these tipe of class in school)
Very nice content and smooth explanation
Thanks a lot for all the effort and keep going 👌🏽👌🏽
Big fan to ur teaching❤️
This was amazing and so so helpful, Thank you very much!!!!!!!
The best exlaination
Thank u man. All these topics are exciting!.
Can you please recommend best books for coding
Wow beautiful whch software u use for animatoin?
Its very helpful and easy to understand.i have a question about the sample code, i have implemented the quick sort code, but it didn’t work out. I don’t know what’s the problems on it :(
Thanks for sharing your knowledge mate 🚀
How did we get n(n+1)/2 from the pattern is something I did not understand?
unbelievable clear!!!
in partition function, why does i is initially l-1, not l?
hi CSDojo Thanks for your explaining just one question which whiteboard do you use?
Great as always. Man you are doing great job. Keep it up.
As always, excellent explanation!
This channel is amazing. Thank you for such a great content.
Can anybody please recommend a good course for Python that would give a certificate and teach you everything?
Hi, can you please tell what tool or software you are using for these presentations and animations?
what software do you use on the Wacom, to make these videos, Dojo :VV ?
thank you foe sowing us also i am watching you vids on python on the 4 vid rn and i just want to say thank you so much for making these vids to help you fans or just people keep up the good work
Thank You ! It helped me a lot
Hi Dojo, please do you have a video that talks about "How to use Java for beginners"?
Do you have a video on Approximate approach or exact approach in finding a solution?