Sorting - Part 1 | Selection Sort, Bubble Sort, Insertion Sort | Strivers A2Z DSA Course
Vložit
- čas přidán 22. 07. 2024
- Book a FREE career counseling session with Learnbay: bit.ly/3km2s6W
@Learnbay is an established EdTech platform with expertise in Data Science & AI and Full-Stack Development courses headquartered in Bengaluru.
They offer several IBM-certified Data Science courses. Since 2015, Learnbay has helped 10,000+ people to have a successful safe career transition.
Follow Learnbay platforms to stay connected for the latest updates & information: linktr.ee/Learnbay
#Learnbay #learnbaycourse #learnbayreview #learnbaydatascience #learnbaycoursereview #learnbaydatasciencecoursereview #learnbayfullstack
Notes/C++/Java/Python Codes:
Selection sort: takeuforward.org/sorting/sele...
Bubble Sort: takeuforward.org/data-structu...
Insertion Sort: takeuforward.org/data-structu...
Full Course: takeuforward.org/strivers-a2z...
You can follow me across social media, all my handles are below:
Linkedin/Instagram/Telegram: linktr.ee/takeUforward
0:00 Intro
2:45 - Selection Sort
6:50 - Pseudo code / implementation for Selection Sort
14:28 - C++ code for selection sort
17:41 - Bubble Sort
22:00 - Pseudo code / implementation for Bubble Sort
25:52 - C++ code for bubble sort
31:40 - Insertion Sort
36:55 - Pseudo code / implementation for Insertion Sort
38:52 - C++ code for Insertion Sort
Book a FREE career counseling session with Learnbay: bit.ly/3km2s6W
Let's march ahead, and create an unmatchable DSA course! ❤
Can someone please add timestamps, I will add them post-it.
Hey @striver @take U forward
, it's a humble request can u, please complete this series soon as the placement season is coming soon....🙏
Hey Striver please complete the series.
@takeUforward Hey!
Can you complete Binary search Section more quickly
Bhaiya , if we solve a question and if need to sort the array then which algo we would to implement
Kaha thay aap,maine itna YT me search kia but aapka channel suggest nahi huwa until mera ek dost ne nahi bola hota
Maira DSA teacher ne jo topic clear nahi karwa pa a aap wo kar di a
Thank you
A lot of problems are going on in my life right now. But still I'm showing up everyday to learn something new in dsa and to solve questions.
Problems will come and problems will go but I should continue my hustle.
All of our struggles will pay off one day.
Hope is the most precious thing do not lost it
Beautiful message that I saw today!
This motivate me, I am going through some similar situation
@@pulkit-rastogi97
don't lose your hope , just keep giving your best so that you won't regret, in fact if you honestly give your best you can , you are likely to succeed !
Same man, i was struggling to get up from bed the entire day. But finally at 11pm i decided i will atlest spend the last hout of my day working towards my financial independece
Selection Sort TC -> worst - O(N^2) best - O(N^2)
2:45 - Selection Sort
6:50 - pseudo code / implementation for selection sort
14:28 - C++ code for selection sort
Bubble Sort TC -> worst - O(N^2) best - O(N)
17:41 - Bubble Sort
22:00 - pseudo code / implementation for bubble sort
25:52 - C++ code for bubble sort
Insertion Sort TC -> worst - O(N^2) best - O(N)
31:40 - Insertion Sort
36:55 - pseudo code / implementation for insertion sort
38:52 - C++ code for insertion sort
Thinking about your notes📝 😮😮
So many videos on Sorting on the internet yet this proves to be the BEST. Thank you so much.
The amount of effort you put in these videos is truly amazing. Thanks a lot 🙏
Striver, you are a gift to us all! thanks so much!
The amount of effort you put in these videos is truly amazing. 🙏
2:45 Selection Sort
17:41 Bubble Sort
31:40 Insertion Sort
😊
Thank you
HI Striver,
One request please provide the videos for upcoming topics asap and Big thank for providing such an amazing series.
What an AMAZING teacher!!!
Understood! Thanks Striver for all this knowledge you are providing for free!
Bhaiya I am following your dsa AtoZ sheet.From 2 day i am trying to understand sorting concept but now it's become clear. Lots of love
This is going to be one of the best series of all time, thankyou so much raj bhaiya, just a small request can you please upload new videos asap, btw thankyou again ❤
Thankyou Striver. It's really an easy to understand. I also learnt to find Time Complaxity from every code by myself after seeing this video. Please make video on other sorting methods. ❤
Finally I found the best DSA course on CZcams. ❤The way you explain concept is awesome. ❤❤
There was not a single second when I felt bored . Thankyou very much for your effort. ❤❤
❤❤
mannnnn!!!! Just addicted to ur teaching🔥🔥, every little concept is crystal clear
😅😅As usual awesome!!
Understood! Amazing explanation as always, thank you very much for your continuous effort for making the video!!
bro in insertion ,why does i has starting value of 0 ,shouldnt it be 1 as single element would be sorted anyways
UNDERSTOOD. Thanks for giving us this course!
I find this is best DSA video i have ever seen on youtube. Thabak you Mr. TUF for this informative session.
PERFECTLY UNDERSTOOD! ❤
Hey striver , it's a humble request can u, please complete this series soon as the placement season is coming soon....🙏
Yes striver 😭 plzzz Want to learn the whole series just from u. Already watched DP and Graph and Trees playlist from ur channel. Plzz striver try to complete this series as soon as possible 😭
Yes please 🥺🥺🥺
brother once striver reaches to Poland he will be regular in posting videos !!
@@bishalkundu7592 u completed DP graph trees and you are waiting for basic topics?
@@yikes3807 Not basic but ya heaps Sliding windows stacks Queues Binary Search. Waiting for this
Understood.
Thanks for your commitment. That in itself is amazing motivation to keep going.
It's easiest explanation I have seen. Appreciate the effort that went.
Hi Striver @takeUforward , in the insertion sort ,the outer loop i.e. the loop with i should start with i=1 instead of i=0 because the j takes the value of i and in the while loop it says j should be greater than 0 so it will always stand false for the first iteration ( j=i=0) and moreover we don't need to check the correct order of single element . Please correct me if i am wrong because i am just saying what I understood .
Yeah you are right I believe. When I saw the outer loop, I was thinking the same thing and when I run the code, it prints the same output as with i=0, just as I thought it would be during the dry run.
please complete this series soon because only 3,4 months are left for placement season its a humble request
I never seen before content where
🔥Crystal level concept Explained ✨Dope🔥
Striver, Your content is truly outstanding and incredibly informative! Always thank you for your relentless hard work and consistently delivering the best content.❤
Otimization:
39:14 Guys run outer loop from int i=1 because there is no way to check first element with left .
Yes that how we can also make best case complexity to O(1) by Initializing cnt =0 in outer loop and in while loop we do cnt++ and if while loop never run (best case ) then cnt remain at zero then in outer loop give a condition if (cnt==0) break;
@@ramrawat681 no buddy we can't that's an error in video i think because while loop is running for every single element and if the element is in correct position means there's no greater element before it cnt will be zero and if you break the loop no elements after that will be checked so it will not give right answer i wonder if you implemented it successfully
For bubble sort striver you are using i>=1 in outer loop in the pseudo code but while using the code editor you are using i>=0.
Same doubt??
there is no need of going till i>=0 . but if you go , this is also right .....i=0 is automatically got minimum number when we are sorting
Quality content....
Explained effectively and completely..
one suggession for insertion sort
why we run outerloop from i = 0 we should start directly from i = 1 till iarr[j])
{
int temp = arr[j];
arr[j]=arr[j-1];
arr[j-1]=temp;
j--;
}
it wouldn't impact anything if the outer loop is running from 0 to n-1 then when i = j = 0 it will no go into the while loop and move on to next iteration of i
I want to understand how does is not give index out of bound error by accessing -1, or it does short curcuit
its 2:20am at 10 am i have exam,so jai shree ram,aur jai baba raj
College which year ??
Amazing yar.. please continue the series faster.. eagerly waiting to learn more!!!
khub sundar, osadharon🙂
Striver any rough idea how long will this a2z course will go
4/5 months, as the advanced section is completed, so its just the basics I need to complete. We will gain speed once am back in Europe in feb 4th weeek
@@takeUforward hey brother can we expect this series will be done by may last.
Best Sorting video until Now THanks bhaiya...
understood!!!
Thanks Striver bhaiya
Understood.
Such an amazing course.
Motivated me today to solve questions again .... And learn ...
you are amazing
all the sorting you taught looks very easy after watching your vdo
understood totally, literally I forgot my phone while your lecture. Thanks a lot
Completed the sorting - I , thank you for the breif explaination bhaiya.
I just wanna say Thank U you are a big brother figure for me...
Thankyou for your efforts! Dsa scares me, but you are making it easy for me
Good Explanation in the Sorting algorithm. Thanks a Lot❤❤ Strivers
Understood. Best explanations for every sorting algo :)
Understood, thank you so much for the lecture and your efforts.
Such a detailed and perfect explanation. Thanks a lot Striver!! Understood the concept really well.
Understood, thanks STRIVER
your explanation is just Awesome. UNDERSTOOD
Understood everything and it became crystal clear topic
understood it way better than anywhere else
Really Thanks to You Sir , Got all my PRoblems Cleared in this Video
I really appreciate your effort. And your videos are helping me a lot. thank you sir🙏
You are the best man... I donot know where this energy come from...
great video and easy explanation helps a lot .
Thank you striver, amazing explaination.
simple and to the point, thank you :)
Very Nice explanation sir, Thank you!
Understood. Thank you for your hard work.
As always excellent lecture ☺️☺️.
Absolutely understood Stiver!💌
Stirver-Forever, Just striving to become the best version of myself. All thanks to raj vikrmaditya bhaiya. You're the best hope for students like us, belonged from tier-3 college, where there is no hope in hell to get a sde job, but their is this man standing with a freakin Sun the light the path for use. I don't know how I will thank you but one day I believe all my hard work will pay off when I will meet you and telling you my story of life, how I made zero to Prodigy. Till I didn't hit it, byy sir I am going back to hustle....
understood
Thank you so much for giving this fabulous course.
Understood,thanks striver for this amazing video.
awesome explanation STRIVER thankyou
Hats off to your effort and teaching skill striver. No one can explain as you were explaining topics🫡🫡🫡
Explanation is amazing 😍
Thank you Striver, I am in my first year but I am learning a lot from you.
Understood
Thanks for this video bhai!
Amazing Video.. thank you sir
Understood, great lecture.
Understood. You are the best!
Understood completely !!
Thanks for this lecture finally understood those sorting techniques
Understood, And big thanks for all the videos.
understood
Thanks striver!
UNDERSTOOD. THE WAY YOU TEACH IS BRILLIANT.
thanks for making this playlist
This is a very good explanation.
With help of explanation itself I'm able to code and did the sorting.
Really appreciate the efforts.
Thankyou for putting out such valuable content
So nice session bro..very well explained
Best Explaination of Insertion Sort!!!
Great work, Striver. Best Free Resource
understood . Thanks for best explaination
Understood everything. Thank You very much:)
great bhai
understood comfortably keep it up bro 💯
folks that was 5:29 AM in striver's clock , please hit the like button for the efforts he makes for us , forever grateful.
Understood, Very well explained.
understood!! amazing...
Thank you so much striver. Your each and every video is such nice 👍
Understood in a very good way
Gotcha Sirr.....!!!!!
Best sorting explanation bhaiya ever i seen love from jamshedpur🤩☺
thank you sir for good explanation and provide best dsa sheet and in this video i first time hear --- left chota -- , ( left small ) ---> at 38 : 40 😁😁 and again thank you sir ❤
Amazing approaches 🔥🔥
Amazing content :)
thanks for this lecture ,,,, understood everything