I got the whole concept in just one dry run but at the end the way he said "chlo ek br aur smjha dete h" shows his love and consistency regarding to students....love uh sir ❤️
I don't have a laptop but aim to crack product base company... That's why I practice code on my mobile phone... 🤘🤘i getting motivation fromu bhaiyaa... Thank u ❤❤ bhut badhiya🙌🙌
Maza hi aa gaya dekh k , ek dam crystal clear ho gaya logic,aap kitni mehnat kr rhe acche se samjhaane ka , that last "one more dry run" truely shows that, respect++
bhaiya ek baat best lagti hai apki...... App hum bacho ki trh sochtey ho like nh aayi hogi fir smjha deta hu....... abh bh nh aaya hoga chlo ek baar aur smjha leta hu merko bh satisfaction ho jayegi🙏 True Educator 🙏🙇🔥
jo aapke andar jazbaa h nh bacchon ko poora satisfy krne ka whether aapke students poori tarah se smjh paaye h ya nhii.. yeh jazba hi humein yha tk laaya h or aage bhi lejyga ..really blessed to have you sir.. bhaiya dil se thanku iss dharti pr aane k liyee🥺🥺🥺🥺
27:30 thank you for motivation ...I thought I am the only one who is facing such prblms and I just got demotivated but your these lines give me strength ♥️
bhaiya maine ye video puri dekhi aur concept start me hi clear ho gya tha par aapne itne baar explain krke dimag me drill kr diya. Lots of Love. 16-06-24
Bro you are amazing..... Because of you those students who can't buy the paid course .... Those students are enjoy this course and gain the knowledge... Keep it bro. ...
what did i learn from this video 1. how do selection sort work , and code of selection sort 2. time-complexity and space complexity of the algorithm 3. is it stable or not
Bhaiya please dsa course mein yeh topics bhi add kardo to sab cover ho jaega 1. Matrix 2. Hashing 3. Deque 4. Segment tree 5. Disjoint Set Please add these topics also bhaiya
I don't have laptop and am doing msc informatics from du and just because of this man I have got too much confidence to perform my code in interview without writing a single code on laptop.
Bhaiya I really enjoy your lecture. na ekdum jada beginner level na jada expert level, ekdam point to point , all clear concepts. Bahot acha laga bhaiya ese cource ka bahot jarurat tha thanks
Homework: Stable and Unstable sorts Algorithm : Merge , insertion , counting , bubble sorts are stable . Quick , heap , and selection sorts are not stable or unstable. Selection sort is an anomaly, because it is not time optimal . It should be able to achieve both O(1) space complexity and stability. Thank you so much bhaiya 🥰🥰
@@tejasp7700 The algorithm used by sort() is IntroSort. Introsort being a hybrid sorting algorithm uses three sorting algorithm to minimize the running time, Quicksort, Heapsort and Insertion Sort. Simply putting, it is the best sorting algorithm around. It is a hybrid sorting algorithm, which means that it uses more than one sorting algorithms as a routine. Internal implementation of sort() function are these sorting algorithms
Everyone is celebrating Diwali in their own way and i'm celebrating with you sir doing your epic playlist .....and it is worth it ....thankyou for being a part of my life...and Happy Diwali.🙏
Homework Question- Is selection sort stable or unstable? Ans- Selection sort is UNSTABLE. Below is the Selection Sort code using functions- #include using namespace std; void arrInput(int arr[], int n) { cout
depends upon the condition that we are applying.. since we are checking strictly less than arr[midIndex] (even your code too) therefore the algorithm will be stable but if you put
@@vanshuupadhyay9551The selection sort algorithm will be STABLE, if we write the 'if' condition as arr[min_idx] >= arr[j], and will be UNSTABLE if we don't write the equality sign.
Brother Amazing Explanation keep teaching us. You are giving your best I know your hard work and stress you get making video and also doing your daily work as an employee or something else. And you are giving your best Thanks bro. Just keep giving us this amazing content really it helps. Thanks.
Bhai jb aapne bola ki -> "Darna nhi h... Coding hi to h aa jaygi.... Ek ni to 2 din me aa jaygi".... Such me bhai ye sunne ke baad confidence such me ucha ho gya... 🤓
i am starting comment from that video but also completed all previous video strictly . believe me you will never gonna find this level of understading anywhere else . also reporting sir 😋
Thank you bhaiyya for the motivation in the end. and the way you feel the fear and then ur words like "drne ki baat nhi h yr coding hi to h aaj nhi to kl aa jaegi , kl nhi to prso😊😊👌", makes our josh high. i want you to ask in ur upcoming videos"how's the josh ". and we will say "high sir.😂🤣👍". thanks again bhaiyya.
selection sort use case:- man lo ki n = 10000 aur selection sort ki time complexity hai n X n toh 10000 X 10000 = 100000000 = 10^8, toh hum us array pe selection sort easily use kar sakate hai jiska size
Stable Sorting Algorithms preserves the order of the elements after sorting, whereas unstable algorithms doesn't preserved the order of elements. STABLE ALGORITHMS :- Merge, Insertion, Bubble sort. UNSTABLE ALGORITHMS:- Quick, Selection sort.
Bhaiya, jo aapne 27:15 yha pr jo baat khi h na mera khoya hua motivation fir se aa gyaa.Thank you bhaiya. Yahi baaat to aapko khaas bnati h ki aap baccho ki dil ki baat samjh jate ho ki is lecture k baad bachcho ke dimag me kya chal rha h.Again thank you very much Bhaiya.
I understand the whole concept thankyou so much bhaiya 😊😊 but in end you said that chalo ek baar or smjha dete h bahut bahut acha lagta h sunke again and again thankyou soo much 😊😊😊😊😊
sir padh to rhi hu but consistent nhi hoparhi but try poora karungi ki consistent bhi rhu hn but ab maza aana start hogya h...coz binary search, space search,s,e,pivot sb clear horha bss placement lgg jaye aaapki series ko khtm krungi phir questions aur lagaungi hope so placement hojayega...😥...thank you so much bhaiya
Bhaiyya.. maa kasam bol rha hoon.. aap mere saamne hote aggar toh.. main aap ke pairon ko choom kar salaam krta... Bhot achcha kaam kar rhe ho bhaiyya.. thank you...
Time complexity explanation: Outer Loop: Iterates through each element of the array except for the last one. Inner Loop: For each iteration of the outer loop, iterates through the remaining unsorted elements to find the minimum element. Let's analyze the number of comparisons made by the algorithm: In the first iteration of the outer loop, the inner loop makes (n-1) comparisons. In the second iteration of the outer loop, the inner loop makes (n-2) comparisons. Similarly, in the ith iteration of the outer loop, the inner loop makes (n-i) comparisons. This pattern continues until the (n-1)th iteration of the outer loop, where the inner loop makes 1 comparison. To find the total number of comparisons, we sum up the number of comparisons made in each iteration: Total comparisons = (n-1) + (n-2) + ... + 1 This sum is an arithmetic series, and its sum formula is given by: Sum = n * (n - 1) / 2 Therefore, the total number of comparisons is: Total comparisons = n * (n - 1) / 2 In terms of big O notation, we ignore constants and lower-order terms. So, the time complexity of the Selection Sort algorithm is O(n^2).
Selection sort is a stable sort.. assume A = [1,6, 4, 8, 4', 7] Selection sort output => A = [1,4,4',6,7,8] Since the number 4 which occur before 4' , in the initial and the sorted array. Therefore, Selection sort is Stable sorting algo
![Lecture 17: BUBBLE SORT in 1 Video [Theory + Optimised Code] || Best/Worst Case Complexity](http://i.ytimg.com/vi/zOhUavxlzw4/mqdefault.jpg)
I just stayed in college to download this video .....
And practice the codes due to I don't have laptop 🙂🙂🙂
Bhai I also don't have laptop but leetcode wale problem mobile par chal jate hai ek bar try karke dehklo
irony
mind your language
i mean english
btw just joking, pls don't get offended
bhaiii kse laptop pejyada der type krne se hatgh m dard hota h tum phone pe code kr rhe ho that is a real struggle
@@daphenomenalz4100 Hasna tha kya chutiye
I got the whole concept in just one dry run but at the end the way he said "chlo ek br aur smjha dete h" shows his love and consistency regarding to students....love uh sir ❤️
True
True yrr the last part was bestt
"ek bar aur dry run" kya bat hai - sirft views nahi satisisfaction bhi chaiye - Thanks a lot
Bhai aap kya cheez padha diya aapne maine socha tha roj ek question karunga maine aaj hi 9 lectures dekh liye aisi aisi videos hain
I don't have a laptop but aim to crack product base company... That's why I practice code on my mobile phone... 🤘🤘i getting motivation fromu bhaiyaa... Thank u ❤❤ bhut badhiya🙌🙌
More power to you
G****d me mobile daal lo
Mobile me coding krnge ge chutiye
Damnn nigga
Bro have you got the job?
Keep it up👍
Maza hi aa gaya dekh k , ek dam crystal clear ho gaya logic,aap kitni mehnat kr rhe acche se samjhaane ka , that last "one more dry run" truely shows that, respect++
bhaiya ek baat best lagti hai apki...... App hum bacho ki trh sochtey ho like nh aayi hogi fir smjha deta hu....... abh bh nh aaya hoga chlo ek baar aur smjha leta hu merko bh satisfaction ho jayegi🙏 True Educator 🙏🙇🔥
jo aapke andar jazbaa h nh bacchon ko poora satisfy krne ka whether aapke students poori tarah se smjh paaye h ya nhii.. yeh jazba hi humein yha tk laaya h or aage bhi lejyga ..really blessed to have you sir.. bhaiya dil se thanku iss dharti pr aane k liyee🥺🥺🥺🥺
"What great men have is always for the good of others" . . . Babbar sir is an excellent example of this quote!!!
27:30 thank you for motivation ...I thought I am the only one who is facing such prblms and I just got demotivated but your these lines give me strength ♥️
bhaiya maine ye video puri dekhi aur concept start me hi clear ho gya tha par aapne itne baar explain krke dimag me drill kr diya. Lots of Love. 16-06-24
Bro you are amazing.....
Because of you those students who can't buy the paid course ....
Those students are enjoy this course and gain the knowledge... Keep it bro. ...
Me as
th-cam.com/video/XbaA1-BI-zw/w-d-xo.html
The best playlist with crystal clear concepts!! ❤❤
A small suggestion...you can do a live session atleast twice a month to clear the doubts of students
A simple request ☺️
An humble request
@@ankushyamkar3602 'A' humble request
@@Ghiloo ☝🤓
Jab padhane wale Guru aise ho toh padhne me bada maza aata hai.. Thanks babbar bhaiya🥰🥰
when it comes to explaining and clearing the doubts priorly no one is better than you
what did i learn from this video
1. how do selection sort work , and code of selection sort
2. time-complexity and space complexity of the algorithm
3. is it stable or not
7 days 7 videos without sacrificing quality...op bhaiya
Suggestion : Bhaiya DSA ki new sheet bana do LEETCODE ke questions ki please. We all are regularly watching your videos.💪💪
Aaegi pkka, kaam chalra hai
Bhai khud hi bna le saath saath
@@CodeHelp kab ayegi sir
th-cam.com/video/XbaA1-BI-zw/w-d-xo.html
thanks a lot
@@CodeHelp
Bhaiya please dsa course mein yeh topics bhi add kardo to sab cover ho jaega
1. Matrix
2. Hashing
3. Deque
4. Segment tree
5. Disjoint Set
Please add these topics also bhaiya
+1
th-cam.com/video/XbaA1-BI-zw/w-d-xo.html
I don't have laptop and am doing msc informatics from du and just because of this man I have got too much confidence to perform my code in interview without writing a single code on laptop.
Bhai , job Mila kya phr ?
@@KRIShna-rh5hs yup
The way you explain the topic is above next level... A big thank 🙏🙏🙏🙏🙏 to u....
explaning 10 times, god of education 🥰
Badhiya content.... Badhiya intent..... Badhiya commitment, or.......
Badhiya student 😎😎🤟🤟
Sir, you are really working hard for us to make things understand....This is enough to give me motivation for practice and understand ❣Thankyou sir!
Bhaiya I really enjoy your lecture. na ekdum jada beginner level na jada expert level, ekdam point to point , all clear concepts. Bahot acha laga bhaiya ese cource ka bahot jarurat tha thanks
27:15 make my mind lighter that it was usual while not getting the questions THANKS !!❤
BRO THIS IS THE BEST C++ COURSE ON TH-cam , THANKS FOR YOUR KIND EFFORTS :-)))
Cant agree more
th-cam.com/video/XbaA1-BI-zw/w-d-xo.html
Homework:
Stable and Unstable sorts Algorithm :
Merge , insertion , counting , bubble sorts are stable .
Quick , heap , and selection sorts are not stable or unstable.
Selection sort is an anomaly, because it is not time optimal . It should be able to achieve both O(1) space complexity and stability.
Thank you so much bhaiya 🥰🥰
bro one doubt , we have sort() function in c++ right , so why are we using different sorting algorithms?
@@tejasp7700 The algorithm used by sort() is IntroSort. Introsort being a hybrid sorting algorithm uses three sorting algorithm to minimize the running time, Quicksort, Heapsort and Insertion Sort. Simply putting, it is the best sorting algorithm around. It is a hybrid sorting algorithm, which means that it uses more than one sorting algorithms as a routine.
Internal implementation of sort() function are these sorting algorithms
bhayya bahot he badhiya samz aaya selection sort agar khud bhagwan bhi aakar batate to bhi isse jyada aur kya samzate bahot he clear huaa sachhi sachhi .... :)
ek baar me hi samjh aa jata hai sab. pro level teaching skill. thankyou so much bhaiya
I love how you use the orange, white and green color for dry running of the your code❤
Everyone is celebrating Diwali in their own way and i'm celebrating with you sir doing your epic playlist .....and it is worth it ....thankyou for being a part of my life...and Happy Diwali.🙏
Homework Question- Is selection sort stable or unstable?
Ans- Selection sort is UNSTABLE.
Below is the Selection Sort code using functions-
#include
using namespace std;
void arrInput(int arr[], int n)
{
cout
depends upon the condition that we are applying.. since we are checking strictly less than arr[midIndex] (even your code too) therefore the algorithm will be stable but if you put
@@vanshuupadhyay9551The selection sort algorithm will be STABLE, if we write the 'if' condition as arr[min_idx] >= arr[j], and will be UNSTABLE if we don't write the equality sign.
Smooth explanation .... Pehle ye searching sorting bahot pahad jaise lgte the...
ab maza aarha h
Brother Amazing Explanation keep teaching us.
You are giving your best I know your hard work and stress you get making video and also doing your daily work as an employee or something else.
And you are giving your best Thanks bro.
Just keep giving us this amazing content really it helps.
Thanks.
Esa ek bhi youTuber nhi h jo ki apki tareh mehnat karta ho jisse ki student ke sabhi concepts clear ho jaye a big thank to u... 🙏🙏🙏🙏🙏🙏🙏
yarr itna mhnati kind koi kaise hosktaa h aj k zmane m...??
Bhaiya zor ki jhappi love you❤ we are with you ✌✋
This DSA course is the best that's available in the entire market
24:35, i understand the reason behind your laugh😂🤣
Bhai jb aapne bola ki -> "Darna nhi h... Coding hi to h aa jaygi.... Ek ni to 2 din me aa jaygi".... Such me bhai ye sunne ke baad confidence such me ucha ho gya... 🤓
thankyou bhaiya for explaining it in such a detail. Thanks for your effort. I am really loving the DSA.
i am starting comment from that video but also completed all previous video strictly . believe me you will never gonna find this level of understading anywhere else . also reporting sir 😋
Apki mehant ko salute itna acche se samjane ke liye maja aa gaya
Crystal clear concept, understood easily👌
sir your explanation is amazing and easy to understand. Someday i would like to meet you
Best teacher of DSA on YT
Thank you bhaiyya for the motivation in the end. and the way you feel the fear and then ur words like "drne ki baat nhi h yr coding hi to h aaj nhi to kl aa jaegi , kl nhi to prso😊😊👌", makes our josh high. i want you to ask in ur upcoming videos"how's the josh ". and we will say "high sir.😂🤣👍". thanks again bhaiyya.
Mehnat Maaro! Cheetah bano! 🔥 Awesome lecture bhaiya, going with this principle, thanks!
selection sort use case:-
man lo ki n = 10000
aur selection sort ki time complexity hai n X n
toh 10000 X 10000 = 100000000 = 10^8,
toh hum us array pe selection sort easily use kar sakate hai jiska size
Stable Sorting Algorithms preserves the order of the elements after sorting, whereas unstable algorithms doesn't preserved the order of elements.
STABLE ALGORITHMS :- Merge, Insertion, Bubble sort.
UNSTABLE ALGORITHMS:- Quick, Selection sort.
kitna lec cmplt hua
@@ris99 Searching and Sorting, Linked List wala hua.
th-cam.com/video/XbaA1-BI-zw/w-d-xo.html
th-cam.com/video/XbaA1-BI-zw/w-d-xo.html
Love bhaiya op ❤️
Bhaiya one request pls upload lecture on alternate day
Because our university exam coming 😕
This DSA series is far better than my premium upskilling program!
love you sir Amazing series chal rha hai
aap ne mera interest la diya coding me
Bhaiya, jo aapne 27:15 yha pr jo baat khi h na mera khoya hua motivation fir se aa gyaa.Thank you bhaiya.
Yahi baaat to aapko khaas bnati h ki aap baccho ki dil ki baat samjh jate ho ki is lecture k baad bachcho ke dimag me kya chal rha h.Again thank you very much Bhaiya.
the way you teach us is like our friends used to teach us a difficult chapter and we used to understand it very easily .
arey yaar! bhaiya ham logo se jyada dedicated aap ho ! EK HEE DIL H LOVE BHAIYA KITNI BAAR JEETOGE🙂
Crystal clear teaching. You are a gem of a teacher
sabse easy rha hai ye wala concept ...best best ever
Thank you sooo much bhaiyaaa maja aa raha hai please continue this series 🥺🥺 meri first salary se apke channel ko join krunga pakka
Wow! Bhaiya Amazing series of DSA 😍🤩🤩🤩🤩
its very Helpfull for me During My DSA preparation ,
i really love it🥰😍😘😘😘😘😘
I understand the whole concept thankyou so much bhaiya 😊😊 but in end you said that chalo ek baar or smjha dete h bahut bahut acha lagta h sunke again and again thankyou soo much 😊😊😊😊😊
Bhaiya Tq😄😄😄, pichla video ka pura uta difficulty, bhaiya maza aa gya😃😃
sir padh to rhi hu but consistent nhi hoparhi but try poora karungi ki consistent bhi rhu hn but ab maza aana start hogya h...coz binary search, space search,s,e,pivot sb clear horha bss placement lgg jaye aaapki series ko khtm krungi phir questions aur lagaungi hope so placement hojayega...😥...thank you so much bhaiya
Which year are you? In college
The one of the greatest selection sort I ever seen
bhaiya life mey pehli baar padhai karkey next level mazza aarhey 🙂🙂
Bhaiyya.. maa kasam bol rha hoon.. aap mere saamne hote aggar toh.. main aap ke pairon ko choom kar salaam krta... Bhot achcha kaam kar rhe ho bhaiyya.. thank you...
watching your videos to understand algorithms and I am in love with this never felt like this want to solve and understand DSA more now thanks alot.
hr vedio me comment karne ke liye words hi nahi bache he bhaiya
in one word i want to define it wow .
Very easy explanation in the whole TH-cam.
kaamal ka knowledge provide krvate ho bhaiya..web series se bhi addictive course banaye ho ap
Time complexity explanation:
Outer Loop: Iterates through each element of the array except for the last one.
Inner Loop: For each iteration of the outer loop, iterates through the remaining unsorted elements to find the minimum element.
Let's analyze the number of comparisons made by the algorithm:
In the first iteration of the outer loop, the inner loop makes (n-1) comparisons.
In the second iteration of the outer loop, the inner loop makes (n-2) comparisons.
Similarly, in the ith iteration of the outer loop, the inner loop makes (n-i) comparisons.
This pattern continues until the (n-1)th iteration of the outer loop, where the inner loop makes 1 comparison.
To find the total number of comparisons, we sum up the number of comparisons made in each iteration:
Total comparisons = (n-1) + (n-2) + ... + 1
This sum is an arithmetic series, and its sum formula is given by:
Sum = n * (n - 1) / 2
Therefore, the total number of comparisons is:
Total comparisons = n * (n - 1) / 2
In terms of big O notation, we ignore constants and lower-order terms. So, the time complexity of the Selection Sort algorithm is O(n^2).
Which site is used by sir to check tha algorithm?
Amazing explanations
Far far better than oul college🎓
As usual, marking present bhaiya.
Bhaiya thank you for help . Aapka lecture bohot aacha lga mai puri videos dekta ja rha ho 🤗
*_#DSAbusted_**_🔥❤️_*
bro the way you told lets dry run once again was heart whelming
Thank You Bhaiya. Last ke 2 videos ke questions bhot complex lgre the to mai darr gaya but wo last wala motivation ne kafi help krdi. Love you 3000 ❤❤
last lecture dekhne ke baad meri phatt ke 64 ho gyi thi.... feeling a bit relieved after watching this lecture
लाजबाब जबरजस्त जिंदाबाद🙏🙏🙏🙏
the way u say question kya kehlata h ye rishta kya kehlata h 🤣🤣....thank you so much sir
the code we practiced of selection sort is unstable algorithm. It can be made stable by pushing the elements instead of swapping them.
hey please give a testcase where it is unstable, in every testcase i found it stable. please think about it..
Thanks sir ...thanks alot I am in 1st semester....and I am learning alot....from...you ..thanks once again
Selection sort is a stable sort..
assume A = [1,6, 4, 8, 4', 7]
Selection sort output =>
A = [1,4,4',6,7,8]
Since the number 4 which occur before 4' , in the initial and the sorted array. Therefore, Selection sort is Stable sorting algo
What about this array:
[2', 3, 2, 1]
Watched, done🤟, roz ek video 40min ki sahi hai 🤟
Most awaited series till now 😅....Than you bhaiya 🤩,bs aise hi raftaar bnaye rakhiye 🤩🔥👍
bhaiya ye samjh aa gaya par pichle wala video mein thoda darr gaye the .....book allocation problem khatarnak tha..
Bhaiya aap Garda samjha rhe ho.. really maza aa gya bhaiya🙏🙏🙏
Can be simply done like this : for(int i= 0 ; i
Best video to understand selection sort.
Aa gyi samajh mein explaination , bhaiya,
Ati Uttam Explanation🤩..
Completed successfully
Motivation at 27:05 was the best !!!!
thank you bhaiya ❤❤❤❤
Hands on chal rahe hai bhaiya but dekhunga jaroor ye video
all sorting algorithms are stable instead of quick sort and heap sort . We can also make them stable by changing the kwy comparison operation
Lecture was amazing ❤️❤️ love This DSA series
Present bhaiya 🔥 and thumbnail op bhaiya
Thank you so much! Itna krne ke liye 💖
Josh kam nhi hona chahiye guyz 🙂