8.3.2 Bubble Sort | Sorting in C++ | Guaranteed Placement Course

Same notes as Lecture 9.3.1

[@proteanguy3411]

Trust me she's gonna best instructor , teacher and mentor 🙏🔥💖

[@Pratyush_Srivastava24]

Her voice 💘

[@Patternninjacrypto]

literally i was impressed by her first few videos and then searched her on youtube but sadly didn't found anything related to her. i wish she would also have channel so we can subscribe her and support her. 😊

[@arpitchugh7297]

The one who wrote the script might be crying in the corner 😂

[@achabacha3809]

She is best but don't leave Mysirg samjhe bachye😁😁😁😁

[@mujtabahussain7015]

one of the*

[@RahulSharma-cy1oz]

Bubble sort - Time complexity is O(n^2) , and in best case it is O(n), if the array is already sorted. Thank you.

[@amans6504]

If the array is already sorted, why would you sort? It would be just an iteration over the array so yeah order of n is obv

[@l4dybu9]

Big O notation is for worst case. Hence O(n^2). For best case, it's big Omega notation Hence Ω(n).

[@aryansharma-wf8sn]

Urvi didi teaches soooooo well she is the best 🥰🥰

[@shreyaschavhan5522]

Notes - Bubble Sort - Concept - [0:10] Bubble Sort - Code - [4:40]

[@shubhsYT]

pdhai krle bhai

[@shreyaschavhan5522]

@@shubhsYT 🙏

[@subhanjanbasu4642]

@@shreyaschavhan5522 thanks bhai

[@chinmaymishra9814]

really felt gratitude didi, thank you for providing such a video for free. It contains the whole 2hrs of class lecture content incorporated in just few minutes, AMAZING.

[@ujjwalverma2870]

In this video the counter should be intialise to 0 not 1 And in the for loop I

[@jatingarg1897]

Thank you so much. You made these concepts so easy for me that looked difficult previously for me. Now, I taught these to my fellow classmates even before they knew.

[@sevenhours1137]

best explanation on this topic, the visuals were extraordinarily effective

[@sudarshanmhaisdhune1039]

Wow!.....short, crisp and to-the-point..

[@hrutiksherekar6516]

Ma'am your voice is so listenable. Great explanation. Thank u so much

[@fahadabdullah510]

You can also do this simply with the help of a for loop like this for (int i = 0; i < n - 1; i++) { for (int j = 0; j < n - i; j++) { if (arr[j + 1] < arr[j]) { temp = arr[j + 1]; arr[j + 1] = arr[j]; arr[j] = temp; } } }

[@harshagarwal920]

you can also take initial value of i=1;for faster code

[@aegg792]

the inner loop would be: for(int j = 0; j < n - i - 1; j++) you may cross-check to see 😊

[@muktagavli1106]

Oh my God I was so worried about Data structure Then i saw your Video It is very Useful Keep up the good work

[@shivammaurya3451]

Thank u aman bhaiya and mam best explanation ever watched 😍🖤❤❤❤

[@ajaykiran6]

Thanks a lot, ye bubble sort confuse kar diya tha teachers ne....ab jaake iska concept dhang se samajh aaya hai, final year mai hu abhi ......this series gives me hope that even I can learn these concepts properly.

[@nayansinghal5157]

Didi from this video i just watched the concept behind bubble sort and the code i printed on my own. The output was correct and I am very happy as I am a beginner and have printed the code very easily. Thx for your lectures.

[@prajnagupta1287]

This is awesome! Very concise and informative😍

[@surbhikumari8443]

Awesome mam after trying to visualise continue 8 hr then i come to video and in shot i got it all points thanku mam

[@LifewRoshu]

Thank you so much AMAN BHAIYA and the whole team of APNA COLLEGE ❤️❤️✨✨

[@asiyaprincess6913]

Nice explained and easy to understand ☺️ Thank you so much mam👍

[@shivammaurya3451]

Thank u aman bhaia mam i m loving your explanation ❤ 😍

[@ahmadshoaibmuslim8470]

The great teaching method, Thanks for serving us these videos, and I have a suggestion please make basic projects and shout them as lessons. thank you so much for this kind of teaching,

[@sageinwoods8859]

ek to awaaz itni pyaari hai upar se padhati bhi world class hain

[@ritu5368]

Amazing! Amazing! Amazing! 🔥🔥🔥🔥🔥💥💥💥

[@parth8746]

Awesome explaining in just 7 min.

[@harshithp3007]

I was able to code the bubble sort algorithm just by the explanation part of this video. Thank you very much !!

[@veeresh4441]

Mention complexity for each algorithm at the end of algorithm

[@Pritamdaspk]

O(n²) sabka yahi hoga

[@GoD_AbHI.]

Best Explanation I ever had.😊

[@puneetmaheshwari]

imma using this explanation for python class 12 thankyou di and bhaiya

[@omkakade4036]

Thank you clear all doubts

[@hruthikakani9274]

I'm of class 11th following your every video .......from Andhra pradesh

[@harshmalviya4831]

[CORRECTION] In the while statement of the program, (counter

[@juffler463]

Yup you are right my brother but no matter if it takes one more iteration because array is already sorted. Yes it will take little more time. And this is not a good practice to make this mistake because you know this that it will take only "n-1" iteration to sort the array Hope you got your answer 👍👍👍😀😀😃

[@joetonyaashish7985]

no bro. there is no mistake as counter is starting from 1 and not from 0. Otherwise you would be correct. since it is starting from 1, loop repeats (n-1) times only.

[@vipulbhardwaj8659]

I need help plz! As we know there are (n-1) iterations So why we take (counter

[@meme-qw6hl]

@@vipulbhardwaj8659 it is for u Instade of using *whileloop* and *counter* u can use this for(int j=0;j

[@meme-qw6hl]

Instade of using *whileloop* and *counter* u can use this for(int j=0;j

[@RahmanKhan-dw6sz]

thank you very much yrr it really helps ......and the music is also motivating....

[@Rishabh_Dayal4444]

sir really thanx a lot you all are doing nice job

[@madhusingh4607]

Bilkul Sare doubts clear ho gaye mere..

[@upamadutta5741]

beach mai ak din ka gaap ho gya tha,yesterday their was no new video, or meri to tention start hone laga tha, and that's why egarly waiting for todays video.

[@AnkitGupta-pr4rg]

Mai commerce student hu phir v i feel the same 😑

[@ashutoshgoyal3461]

same here

[@ashishsingh4437]

thank you for this awesome course

[@rita_martha]

I recommend this video. I am very happy and grateful.

[@vatsalkhatri514]

This can be minimised by putting a boolean for checking whether there are swaps or not. If there are no swaps then it proves that the array is already sorted no need to go ahead and hence breaking the loop.

[@saipadmajakuncham]

can you share that code

[@abhishekkholiya6989]

Bubble sort complexity - Time complexity - 1. Best case - O(n) ( if array is already sorted ) 2. Average case - O(n^2) 3. Worst case - O(n^2) Space complexity - O(the number of extra variables used) if 1 extra variable then O(1) , if 2 extra variable then O(2).

[@developerakhter______0076]

BEST Bubble Sort VDO ever...❤

[@mdfoysalahmed4612]

Thanks for this amazing tutorial

[@daksheshrajal2975]

Aman bhaiya is doing good for all of us and we should be thankful to him This channel deserves 1 million subscriber.

[@adityaparmar1897]

Thanks sir for this series , this help me more for my placement preparation

[@negasonicteenagewarhead]

@@SahilSharma-vl9rk bro it's less than n

[@prmomaths757]

@@negasonicteenagewarhead what do you mean?

[@rajlaxmipaul21]

@@negasonicteenagewarhead you have n o t said anything exactly "in a clear way". soou.. wht's da point of commenting “

[@negasonicteenagewarhead]

@@rajlaxmipaul21 The person I replied to has deleted his comment

[@rajlaxmipaul21]

@@negasonicteenagewarhead oou i didn't understand dat

[@iamgroot20]

superb explanation👌👌

[@rutvikrana512]

We don’t need to run n times this algorithm If we don’t find any swapping. It’s like break when no bubbles happens. As per video... Current Time complexity : O(N*N) But it can give O(N) in best case eg. already sorted array. Just check by boolean that if no bubble produce ( no swapping occurs ) break loop. 👌

[@snehilsinha4689]

I agree with you that it will give O(n) time complexity in best case. But that's not our concern. We have to find some algorithm so that the worst case time complexity gets minimized ,which according to me, can't be lesser than O(n^2) in the bubble sort method. If there's a way to decrease the worst case complexity here please share. 🙏

[@novaprime8735]

Great.....

[@svworld01]

You are right bro, this is updated bubble sort that you are talking about. 👍👍

[@anakingaming3687]

Aap sab log kaafi padhe likhe lag rahe ho, aap logo ki job lag gayi h kya yeh videos dekhne k baad ?

[@svworld01]

@@anakingaming3687 pahle hi lag chuki hai job bhai.. Pr aise q bol rhe ho?

[@lalitshah7867]

Didi bahut achha hai thanks

[@DevendraChoudhary888]

Nice work by didi and aman bhaiya

[@ekansh6267]

Awesome explanation 👌👍

[@friendgaming4651]

Wow🤟🔥🔥🔥.. Excellent

[@vedantparatkar7266]

YOU ARE doing very good job ,best teacher!!

[@DrManju_1]

Name was corrected, but *also correct the description box from 9.3.1 to 8.3.1 !* This is Aman Bhaiya, 😉 No Chance of Mistakes. Even when once there was a error in animation in Maths, he corrected it in the comments !!!

[@yogeshvats1999]

Very easy to understand it now rather than boring lecture in class

[@prashantdhami4863]

dislikers are Chintu's ghar vaale who paid 100k plus rs to white hate 😂

[@coderx1871]

Very well explained Shradha didi

[@jaimodkumar5282]

It's very fast and effective method to solve bubble sort as how to works and implement in program

[@rajivkumawat7940]

nice explaination mam.....

[@__lyricsSmooth]

Best way for learning apna college by shraddha didi❤

[@MrKB_SSJ2]

This was really helpful. Thanks

[@ShivamGupta-cx3hy]

Thank you so much ❤️😊

[@anabildebnath2590]

Simple and precise

[@gopalmasulkar8915]

Dear sister your awesome I like your teaching 🥰

[@ShubhamSaraf30]

Counter < n hoga in while condition. I think. Ma'am ke code mei bhi -1 type nahi hua (maybe due to some error)

[@ultimatecreed5144]

yes n-1 nahi n yoga

[@namanjain0412]

Awesome course🤞🤞🤞🤞

[@fahadmughal9795]

in while loop counter is not less than n-1 its while( counter < n )

[@ByteBit4k]

either it is

[@AkashVerma-sh5pb]

instead of the while loop we can also do this : for(i=count-2;i>=0;i--){ for(j=0;jnumber[j+1]){ temp=number[j]; number[j]=number[j+1]; number[j+1]=temp;

[@user-yx3xu6ih8j]

very informative good video💓

[@singhrocco]

5:25 didi ham ek swap() function ka bhi to use kar sakte hai bas swap(arr[i], arr[i+1]); ek line me ho jata 3 lines ke jagah

[@ashwinpillai9291]

nah ...then u would have to create the whole funtion for swap() seperately >....thus same amount of work...Use funtion only when u need to repeatedly use it

[@harshkantbhatnagar360]

​@@ashwinpillai9291 no in the bits/stdc++.h header file it's already present we can use that in place of iostream

[@namitgarg3364]

@@harshkantbhatnagar360 We can also use this function using iostream header file see this code #include using namespace std; int main(){ int a,b; cin>>a>>b; cout

[@harshkantbhatnagar360]

@@namitgarg3364 okay bro

[@namitgarg3364]

@@harshkantbhatnagar360 No problem bro

[@harshvardhan6213]

Consistency = Aman Bhaiya And we all of us also be in a consistent manner always💥🙋🏻‍♂️

[@vrushaliagate5250]

Amazing🔥🔥🔥🔥🔥❤️❤️

[@omraja404]

Thankyou ma'am

[@alangeorge1090]

Really well explained

[@sonudeep6472]

Great tutorial👨‍🏫📓

[@huzaifasaqib8138]

Thanks!

[@hardikverma8249]

Thanks a lot I got it 🥳

[@jaimodkumar5282]

Thanks so much

[@himanshuprem600]

thank you.......

[@MRMAC-hh9op]

Thanks didi and bhaiya

[@AkibHussain]

Op🔥📌

[@user-ng7eg9nq7f]

before apna college ,i was dumb in coding,concept of coding went to upper side from my head,One day i meet to my brother,He suggested me to see coding on apna college,,and then after this,, now I can say that i can do something in coding.Love U all apna college team,,One day I shall meet to apna college team sure,specially Shradhha di.

[@Saini2448]

Thank you mam 🤗

[@angrybird707]

i loveeee ur HAIN NA!!! :)

[@AkibHussain]

Thank you

[@vaishnavighate8068]

It took my clg sooo many hours to explain this and still kuch samjh nhi aaya.. But thanku didi and aman bhaiya for such amazing content.. Thankyou❤❤

[@sanketsingh5555]

Thnx buddy ❤️

[@NitinSihag]

Keep it up bhaiya💟💟

[@krishsharma6276]

Thanks ☺️

[@NishantSingh-br6iu]

East or West Urvi Di is the best

[@user-zw1xp7it3o]

how did you get to know her name ?

[@harshraj-yz3pf]

Wo jab Apne code ko run Karti hai ...toh waha pe unka Naam show hota hai

[@meharsingh3091]

Her name is shardha

[@VikramKumar-qw5cz]

Nice lecture..

[@Exploring_With_Sourav]

thanks for making

[@MohitSingh0798]

Best video

[@sniffers4778]

I love the 15 chocolate example

[@prabhdeepsingh5222]

love u guys

[@shaleenbadola4514]

well its (counter

[@gauravjain1444]

It is not just because we will have to do one less iteration , in the code we are comparing the (i th) and (i+1 th) terms. So we keep the counter < n-1 so that when we are checking for the (i+1 th) term we do not get *INDEX OUT OF BOUND ERROR*

[@shaleenbadola4514]

@@gauravjain1444 ya i know that but it should be counter

[@gauravjain1444]

@@shaleenbadola4514 counter

[@shaleenbadola4514]

@@gauravjain1444 i agree with counter not should be initialized with 0 but in video di said counter

[@gauravjain1444]

@@shaleenbadola4514 see the video once again they edited the -1 part out 😅 .she says n-1 but in the code she writes n

[@saumyasinghchauhan275]

Thank uh

[@shettycodes]

Thank you for explaning bubble sort in concise way easily🙂

[@krishangupta7055]

well i prefer this code. //Sorting is done here for(int i=0; i

[@ADEEBARASHIDBAI]

thank you so much

[@HeaDHunteR-xu7we]

Bhaiya , please make a video on IP university order of choice filling 🙏🙏

[@abhaytiwari6411]

WellDone Guru

[@javeriasaleem3154]

great

[@mamonipodder5613]

I'm very dumb in computer science but the way she explained really helped me