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

[@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).

[@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.

[@proteanguy3411]

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

[@Pratyush_Srivastava24]

Her voice 💘

[@Harshp062]

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*

[@aryansharma-wf8sn]

Urvi didi teaches soooooo well she is the best 🥰🥰

[@daksheshrajal2975]

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

[@nayansinghal23]

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.

[@शिवांकठाकुर-स8ल]

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.

[@hrutiksherekar6516]

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

[@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

[@ujjwalverma2870]

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

[@shreyaschavhan5522]

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

[@shubhsYT]

pdhai krle bhai

[@shreyaschavhan5522]

@@shubhsYT 🙏

[@subhanjanbasu4642]

@@shreyaschavhan5522 thanks bhai

[@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.

[@anshulpatidar5990]

In while loop, its while(counter

[@CodeWithPabo]

yes you are right

[@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).

[@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

[@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

[@harshithp3007]

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

[@Guptaaryan1411]

In case, if you are stuck Use this: int counter=0; while(counter

[@khalidmustafa7102]

Isme h na 100 0 2 29 le rha hun to 2 0 29 100 output de rha h

[@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

[@Spot-Music_01]

Best way for learning apna college by shraddha didi❤

[@hruthikakani9274]

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

[@veeresh4441]

Mention complexity for each algorithm at the end of algorithm

[@Pritamdaspk]

O(n²) sabka yahi hoga

[@yogeshvats1999]

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

[@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?

[@harshvardhan6213]

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

[@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.

[@madhusingh4607]

Bilkul Sare doubts clear ho gaye mere..

[@shivammaurya3451]

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

[@LifewRoshu]

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

[@fahadmughal9795]

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

[@ByteBit4k]

either it is

[@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❤❤

[@cyber_nerd5844]

A tiny mistake at 4:59 where u said counter

[@meme-qw6hl]

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

[@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;

[@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,

[@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 !!!

[@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

[@jaimodkumar5282]

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

[@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

[@mamonipodder5613]

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

[@developerakhter______0076]

BEST Bubble Sort VDO ever...❤

[@divyamharbola6876]

Everyone do like man, They are providing Platinum for free.

[@sudarshanmhaisdhune1039]

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

[@marketing_with_nosh]

Best class ❤❤

[@puneetmaheshwari]

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

[@DevendraChoudhary888]

Nice work by didi and aman bhaiya

[@sevenhours1137]

best explanation on this topic, the visuals were extraordinarily effective

[@shivammaurya3451]

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

[@sumitbangra8359]

Complete code ek saath dikh jata to shi rhta😊 baaki video jbrdsttt hai 👌👌💥💥💥

[@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 😊

[@gopalmasulkar8915]

Dear sister your awesome I like your teaching 🥰

[@krishangupta7055]

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

[@ADEEBARASHIDBAI]

thank you so much

[@rita_martha]

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

[@nihal177]

Bhaiya apni kaksha mai pls thoda jaldi jaldi video daalo kyuki humare per board hai agle mahine se hum of wale hai bhaiya aur kv mai pre board pahele hota hai... Mujhe pata hai app bahut mahenat kar rahe ho aur animation mai time bhi lagta hai lekin fir bhi bhaiya thoda jaldi🙏🙏🙏

[@sageinwoods8859]

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

[@kv-ll2fn]

i have done c++ the much it is needed for dsa. you explain the dry run thing very well but when it comes to code there are many things i am not understanding.

[@NishantSingh-br6iu]

East or West Urvi Di is the best

[@A7503-d4i]

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

[@jaydeep6757]

*NOTE*- COUNTER MUST BE INITIALIZED WITH 0 INSTEAD OF 1, as she explains... But taken 1 mistakenly.... #CHLO PHODTE HYY ✨⚡😎

[@coderx1871]

Very well explained Shradha didi

[@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

[@GoD_AbHI.]

Best Explanation I ever had.😊

[@lalitshah7867]

Didi bahut achha hai thanks

[@omkakade4036]

Thank you clear all doubts

[@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

[@prajnagupta1287]

This is awesome! Very concise and informative😍

[@AnshikaSingh0600]

Very nicely explained 👍

[@marudharkanwar2067]

Everyone is a legend until aman bhaiya walks in😎😎😎

[@HamadKhan-k5x]

loved your unique method of teaching programming.....its becoming so easy for me 😍😍😍😍😍😍😍😍😍😍😍😍😄😄😄😄😄😄😄😄🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰

[@examnotes-jee3184]

What a short🔥🔥😍

[@sniffers4778]

I love the 15 chocolate example

[@clonedaddy1824]

There is a mistake in this code ,the last input no is not get check or swap. Int counter is starting form 1 and if the input is (54321 it will give 23451 ) it is not checking the last element. Plz check this . Y the counter is not staring from 0.

[@vimabhardwaj8206]

just want to notify that there is an error in notes ... in the for loop statement of bubble sort ...n-counter will be there instead of n-counter-1 :)

[@atanmehdi6681]

its correct , the code written in video is wrong.

[@lakshyajoshi5413]

the code in video and in notes both are correct look in the video counter=1 and in notes counter=0

[@abhishekraibagi2869]

@@lakshyajoshi5413 but code is not working it's showing exit with code status 0

[@asiyaprincess6913]

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

[@KhinHanDi-o8o]

very informative good video💓

[@uttamkarmakarece3534]

I don't think anyone can explain the bubble concept so easily than how our Didi teaches us 😍❤️ *** The condition inside while loop should be counter

[@sourabhsingh5941]

no bro u are wrong if the condition inside while loop is counter < n-1 then it actually means n-2 because the relational operator is "

[@novagames5719]

@@sourabhsingh5941 he is correct bro my code won't run on that condition given in lecture

[@prabhakarpatel6388]

in place of while loop , if we use for loop , have same time complexity , but space complexity may be improved.

[@iamgroot20]

superb explanation👌👌

[@friendgaming4651]

Wow🤟🔥🔥🔥.. Excellent

[@prashantdhami4863]

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

[@parth8746]

Awesome explaining in just 7 min.

[@ekansh6267]

Awesome explanation 👌👍

[@vishalvarma8300]

Hello team, Please try to mention complexity analysis for each necessary videos and if possible please inculde the puzzles similar to later videos Overall learning experience is too good and simple and best. Thank you.

[@ritu5368]

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

[@vedantparatkar7266]

YOU ARE doing very good job ,best teacher!!

[@rajivkumawat7940]

nice explaination mam.....

[@RahmanKhan-dw6sz]

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

[@namanjain0412]

Awesome course🤞🤞🤞🤞

[@tilakjilka6446]

I think the whole algo is correct but instead of creating temp variable for swapping we can like use function swap( arr [ i+1], arr[i] ) this will reduce time and logic is simple too ! what say !

[@oneseven1]

Aman bhaiya...thoda aur sound increase kijiye...srif yehe video mein nahi aur bhi 2-4 aur video hai jismen sound level kamm hai

[@minni9752]

Amazing lecture 👍

[@aditshah2662]

@@SahilSharma-vl9rk editing mistake

[@proteanguy3411]

@@SahilSharma-vl9rk n-1 in index but for size it will be run

[@aditshah2662]

@@SahilSharma-vl9rk bhai mereko nahi pata hai i m a class 12th student..... i think it might be editing mistake

[@novaprime8735]

@@aditshah2662 bhai explanation me n-1 times tq loop chalane ki baat ki gai hai na ki n-1 index tq.... Kuch bhi galat nahi hai.....

[@aditshah2662]

@@novaprime8735 ok

[@aishwarya1895]

Time complexity:O(N^2)

[@aniketjaiin]

By mistake you have put 9 instead of 8 in the title of the video...kindly correct it...It creates confusion...you are awesome...thanks for this series.🙂

[@pranav_1056]

Bhaiya just a reminder( I know you definately remeber) Please upload the notes of 8.2 video They aren't uploaded yet 🙏🙏

[@Rishabh_Dayal4444]

sir really thanx a lot you all are doing nice job

[@shettycodes]

Thank you for explaning bubble sort in concise way easily🙂

[@xoloera1x254]

di apne bola ki hume (n-1)iteration ke baad sorted array milega to is hissab se while loop (count

[@educationalhub1904]

DIDI your voice is so attractive and I like your intro as well as your content is fantastic more help to me preparation for placement

[@HeaDHunteR-xu7we]

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

[@hisokamorrow7976]

apart from using 'while + for' loop, one can also use double-for loops: for(int i=0;i

[@mansha6566]

i think j's loops should be from 0 to n - i - 1?

[@hisokamorrow7976]

@@mansha6566 I dont think so, for i=0 it's supposed to run till 5(4th index) and for i=1 till 5-1=4(3rd index)

[@mansha6566]

@@hisokamorrow7976 I don't think so, for i=0 ,j should run from 0 to 3 only ,on fourth iteration(for j=3) you will get largest element at the end of array ,plz check

[@hisokamorrow7976]

@@mansha6566 Ah! I got what you're saying thank you for correcting, I mistook this comment as the one on search video. Thanks

[@mansha6566]

@@hisokamorrow7976 ☺️🤘

[@sharathk568]

Below is the bubble sort that i have done based on her explaination.....any comments on its time complexity. for(int i=0; i

[@deepadixit5719]

Apti or DBMS ke liye bhi bana d0 bhaiiyyaa🥺🥺