Finally, a tutorial explaining not only the logic of the algorithm, but the logic behind it's iteration. Thanks a bunch!
@blueskyrelaxmusic8 жыл бұрын
This is what we need in youtube. Great lecture with great timing.Good job.
@ibzih4 жыл бұрын
Dude this 10 mins video is worth my uni's multiple hour lectures. Very helpful! Thanks!
@mycodeschool11 жыл бұрын
Hi Ravi, I guess you are talking about 6:03. Outer loop is running from 1 to n-1 (we could have run from 0 till n-2 also) which is n-1 times. If you bubble up n-1 elements, last one - nth one will automatically be in place. So, no need to run n time. Inner loop is running from 0 till n-2. It's again n-1 times. So, it looks correct to me.
@Madeehulhassan224 жыл бұрын
O
@markosavic45443 жыл бұрын
Line where first for is will be executed n times,not n-1
@vinhnguyen-o5z2 жыл бұрын
back when youtube didn't have the reply feature huh
@ganeshk86822 жыл бұрын
May is confusion with looping where less than symbol. < n- 1 is nothing but up to n-2 inclusive int[] arr = {0, 2, 1, 2, 0}; int n = arr.length, temp; for(int k=0; k< n - 1; k++ ) { for (int i = 0; i < n - 1; i++) { if (arr[i] > arr[i + 1]) { temp = arr[i]; arr[i] = arr[i + 1]; arr[i+1] = temp; } System.out.println(Arrays.toString(arr)); } }
@jobearnest2 жыл бұрын
@Ganesh K in ur prgm second loop can be optimised like: for(int i=0;i
@curiouswithAi6 жыл бұрын
This channel is a true Gem For Students. Got an exam tomorrow. Would have been really difficult without You. Thank You so much for this!!!!!
@allblue70276 жыл бұрын
i swear this is way better than some of the professors video in schools
@crazy-maxedout3 жыл бұрын
on the gang!
@khoitan47583 жыл бұрын
I think I have a short attention span and I can get tired very quickly. And direct teaching in school is just too slow for me as teachers just try to explain every single detail. Most KZbin videos are just short and have enough information so I understand them almost immediately.
@zerospectator41193 жыл бұрын
Mine just straight up doesn't teach anything
@shankar74356 ай бұрын
100% true.❤❤❤
@viditsinghbrahmania14764 жыл бұрын
I can not even fathom how much effort would be needed to make something like this, and it is freely available! I don't know if any of you have noticed, but he is using MS Paint. And I didn't know it could ever be used to make something useful, let alone this. I always used to undermine myself, considering that I am not a 'programmer'(never really understood these simple concepts, due to shitty teachers), but in the last few weeks, I've learnt so much only because of you and other good content on the internet. And now I proudly say I enjoy programming and I am a programmer!
@preetshah69552 жыл бұрын
This is the best channel for learning algorithm and data structure. I am coming back here after 5 years
@minimalist_pc7 жыл бұрын
your explanation is perfectly clear and the coding is really simple. Thank you so much!
@ahinsa__parmo__dharam3 жыл бұрын
When you reach for O(n), i'm shocked because I had never seen this version of bubble sort .. hatsoff to you.
@saltyfish1578 жыл бұрын
You are the best explainer I have ever seen
@ANILKHANDEI4 жыл бұрын
The video is perfect. Thanks for the ultimate collection. One check is that outer loop runs n-1 times and inner loop is an arithmetic progression n*(n-1)/2 instead of n-1. The total being n+ (n*(n-1)/2= O(n^2). Just wanted to point out. Let me know if my consideration is wrong.
@chelseakatsidzira71535 жыл бұрын
very helpful thank you so much. this is honestly the most clear cut explanation on youtube
@mauriceudoh724310 жыл бұрын
This is simplified enough for a comprehension, Thanks !!!!!!!
@cagnusmarlsen40504 жыл бұрын
In all of the videos the voice and the language is pretty clear and sharp so there's no need for sub-titles.
@maheshvalikar27888 жыл бұрын
You are the best presenter i have ever seen. Very much useful. This kind of tutorials what we expect. Great job bro.
@thatswhatsup049310 жыл бұрын
Thanks so much! subscribed! This is so much more helpful than my text book :D
@mycodeschool10 жыл бұрын
thatswhatsup0493 You are most welcome :)
@PhaniKatakam8 жыл бұрын
Thanks Bro! Nice efforts.. and I like the variations you explained how we improve with flag...etc../\
@gauravlotekar6607 жыл бұрын
boss i feel like dumb dumb dumb when u talk about big(o).I need more help with it.Any suggestions?
@manishasharma-hy5mj11 жыл бұрын
Thank you so much for the series of sorting algorithms. I request you to give explanation on heap sort.
@harshalberad59575 жыл бұрын
You have to learn tree chapter first if you want to learn heap sort
@peterandreash28415 жыл бұрын
Search for "udiprod" on KZbin, they have a great explanation.
@ishanpand3y5 жыл бұрын
I think outer loop shouldn't start with one because if k won't be starting at zero then the inner loop will go only n-k-1 i.e if k = 1 it'll go up to n-2 times if there's a small variable at the end of the array then it won't be able to reach the end to compare as it'll end one before the last one. For example this below code : // bubble - sort class BubSort{ void sorting(int A[],int n){ for(int k = 1 ; k < n - 1 ; k + + ) { boolean flag = false; for (int i = 0 ; i < n - k - 1 ; i + + ) { if (A [ i ] > A [ i + 1 ] ) { int temp = A [ i + 1 ] ; A [ i + 1 ] = A [ i ] ; A [ i ] = temp; flag = true; } } if (flag == false) break; } for ( int i = 0 ; i < n ; i + + ) { System.out.println(A [ i ] ) ; } } public static void main(String...ssg){ int A[] = {42,23,54,76,23,6,34,8,4,2,3,1}; BubSort b1 = new BubSort(); b1.sorting(A,A.length); } } output - 2 3 4 6 8 23 23 34 42 54 76 1
@aparnamane28465 жыл бұрын
right also flag variable when included and unsorted array is passed the output obtained is not correct
@anchitbhushan61726 жыл бұрын
@9:19 i think the inner loop will be executed n-1 times when there is an already sorted array as input
@ravs6 жыл бұрын
Your explanation is by far the best. I wish I could explain to my students in a similar fashion. Keep posting. Good work.
@ezechielmusic7 жыл бұрын
maybe i'll teach my prof tomorrow , thank you bro , it was really clear. :)
@goldenotis97036 жыл бұрын
Best big o notation explanation I've seen so far and its not even a big o analysis video
@kkoli3 жыл бұрын
this videos are much more better than the paid ones thank you sir you are really doing great work
@LLLLLLEON2168 жыл бұрын
Much better than my prof's lecture! Thanks!
@shreyasinghthakur28628 ай бұрын
For people wondering why n-2 and not n-1 ----- Explaination - In an array, "n" typically represents the total number of elements in the array. So, "n-1" would refer to the index of the last element in the array since array indexing usually starts from 0. For example, let's say we have an array with 5 elements. "n" would be 5, and "n-1" would be 4, representing the index of the last element in the array. So if we have an array called `arr`, `arr[4]` would be the last element.
@CompilerStuck2 жыл бұрын
I feel like being back in school reading stuff on the almighty overhead projector
@sriharshasaraswathula61276 жыл бұрын
The outer loop must execute from 0 t0 n-1, otherwise last element will not be sorted. code: for(int k=0;k
@Shailendrakumar-ge5cf2 жыл бұрын
Even it is 9 year old . This video was very helpful. Thanks for sharing you've got a new subscriber :)
@zhangjing19928 жыл бұрын
question in 9:05(I feel it should be like this ): if(flag == 1) break ; not even one swap if flag ==0; then doesn't that mean we need to swap?
@akhilgupta36644 жыл бұрын
Brilliant explanation !! Need teachers and mentors like you , that will change the whole learning process !! Thanks 😀✌️
@joecoke69258 жыл бұрын
Really smart to focus on constructing the inner-loop first. It really makes everything more clear.
@its4pg11 жыл бұрын
Hi Animesh Sir, You are doing tremendous work.You explain very well, so far I have seen many videos in Algos & DS but these vids are the best one, small compact and fully explained !! All the very best for your mission, to literate the illiterate Engineering students.
@pramodkajla6 жыл бұрын
Best explanation on bubble sort. I have checked out lot of videos but, I was still not clear about the concept. Finally, this video helped me. Thank you so much. Excellent work.
@piaNegi9 ай бұрын
Thank you sir for explanation ❤️ But what made me comment here is You sound exactly like a krsn katha vachak (i don't remember his name)
@thePrinceOfPurpose6 жыл бұрын
Actually, if you start from 0 and your size of the array is n. Then n-1 will allow you to go to a[i+1]. You're missing an element if you only go to n-2.
@Pablo-ho2rg2 жыл бұрын
No
@AshChaudhari7 жыл бұрын
i think u made mistake... A[0,1,2,....n-1] for i
@tushardev51353 жыл бұрын
best videos i have ever found for dsa
@VinayYadav-pl7xw8 жыл бұрын
Great explanation..... Exactly what tiny brains like me required :)
@shobhitranjan39574 жыл бұрын
Brilliant explanation of BUBBLE SORT so far!
@rnjnmhta.catomato2 жыл бұрын
best video on bubble sort ,concise and clear
@ShahidulIslam-qd2mv6 жыл бұрын
Nice presentation. Thanks a lot. Seems like, learned bubble sort newly after completing graduation about 10 years ago. One thing, at 9:45 will it break the inner loop or outer? Sorry for my ignorance.
@aLogicalNut74 жыл бұрын
The outer loop. That if condition should be placed after the inner loop.
@davidnovosardian68487 жыл бұрын
You explain it sooo much better than my professor, I don't know how my professor became a professor. OMG thank you
@zhangjing19928 жыл бұрын
hi, just one small mistake: in 6:12 the T(n) = (n-1) * (n-2) * C ; I think that's your meaning there.
@ahsantahirprogramming3 жыл бұрын
Your Chanel Is Best For Pograming
@mairajshariff11675 жыл бұрын
I want solutions for below given problem, kindly help: 1- Why are we interested in worst case analysis? 2- What do you understand by rate of growth or order of growth? Why it is important in analysis of an algorithm? 3- For following set of functions, indicate whether f = O(g), f = Ω(g), or both. 1) f(n) = n − 10, g(n) = n + 10 2) f(n) = 10n^2, g(n) = 3n^3 + n^2 4- For f(n) = n^2 + 2n^3 − 100nlogn + 10, provide the simplest possible function g(n) such that f(n) = Θ(g(n)). 5- Show that n log n is O(n^2) but that n^2 is not O(nlogn). 6- Prove or disprove the following: √n = O(logn) 7- Use a recursion tree to determine a good asymptotic upper bound on the following recurrences. 1) T(n) = 2T(n − 1) + 1 2) T(n) = 4T(n/2) + cn 8- Consider the recursive binary search algorithm for finding a number in a sorted array. (a) Give recurrence for the worst-case running times of binary search algorithm. (b) Use a recursion tree to determine a good asymptotic bound for the recurrence tree. 9- The ternary search algorithm locates an element in a list of increasing integers by successively splitting the list into three sub lists of equal (or as close to equal as possible) size, and restricting the search to the appropriate piece. (a) Give recurrence for the worst-case running time of the algorithm. (b) Use a recursion tree to determine a good asymptotic bound for the recurrence tree. 10- Provide recurrence relation and a tight asymptotic bound for the following code. long power ( long x , long n ) if ( n == 0 ) return 1; else return x * power ( x , n−1);
@vaibhavnag11549 жыл бұрын
thankyou so much my code school, it helped me a lot... it is much better than hand books... and through these videos it is easier to understand and remember all the things.. Thank you
@birukanley65863 жыл бұрын
you are great you make me feel not just to understand rather to feel.
@babandimuhdnasir7057 Жыл бұрын
What an incredible explanation
@aniketpandey20075 жыл бұрын
If im not wrong sir, I believe you are trying to call an external swap() function in this code, and in that case a default call by value does not work, I think you should pass the values by reference, for the actual array to be sorted within the main() function. Hence it should be swap(&a[I],&a[I+1]).
@Danger4186 жыл бұрын
This would easily qualify for priced courses. Very good presentations.
@rishibharadwaj684 жыл бұрын
Great explanation. Crisp, simple and to the point!!
@KETKIPATILBCE4 жыл бұрын
Thank you very much....this code I was trying to mug up ..now you made it's concept really simple and understandable
@Tankionlineandgold2 жыл бұрын
Thanks a lot man i tried a lot pf vidoes to understand it and this is what helped me understand how it really works
@compilerrun55163 жыл бұрын
According to views of this playlist seems like merge sort is a hot topic.
@outofonesmind67227 жыл бұрын
The first loop should be from k= 0 to (n-1) right??
@001BerialSu7 күн бұрын
Really nice!
@jatinagg82217 жыл бұрын
Best channel for computer science student. Thanks for sharing knowledge to us🙏🙏
@dnyaneshwarrajdev64286 жыл бұрын
ddf
@UNUNUN1110 жыл бұрын
nice explamnation I am taking Master in Computer Science I will have a course Advance Alogrithms so I am reviewing some sort algorithms
@tharindudissanayaka7 жыл бұрын
in our language "Supiriiiii.....!!! "Great tutorial ... I've cleared many things............
@harabe1sh1o10 жыл бұрын
Great viddeo. A minor note that the loops look like this: for(int k = 1; k < size; k++) for(int i = 0; i < size - k; i++){
@emi.grigore7 жыл бұрын
pseudocode and C++ are 2 diff things ;) so his loops are fine, because the title is bubble sort algorithm, not C++ program. No offense :D
@Jsheng0077 жыл бұрын
Thanks man for the c++ for loop
@sanjanind6 жыл бұрын
watch till the end, he mentioned that.
@vikasrajput42046 жыл бұрын
U r ri8 I also noticed in b/w...there is a minor mistake (n-k-1) must bi replaced with (n-k) in the 2nd for loop..!!
@TechHints6 жыл бұрын
@@emi.grigore any programming code is a sort of replica to their pseudo code, so we should not do logical error in writing pseudo code or it can hamper the chance of writing the correct code. No offence to any one.
@l.p.95684 жыл бұрын
I think 6:14 should be cn^2 - 2cn + 1c. i.e., the last part is not 1, but 1c.
@folakeaiyetigbo41092 жыл бұрын
I was thinking so too
@animeshnayan111 жыл бұрын
Hi Rakesh, You can choose to start with whatever. In the end, your code should not be buggy. The pseudo-code in this lesson is good. You can try it out in a real program.
@jalsacentre10404 жыл бұрын
Remember this obsession Selection sort and bubble sort requires same no of comparisons n(n-1)/2 But in worst case bubble requires n(n-1)/2 swap rather Selection required n-1 swap ..... in my one interview question was asked Like which Sorting Algorithm is best If we consider only Swapping in complexity?
@prateekjain77853 жыл бұрын
Thanks 🙏
@yogeesh86379 жыл бұрын
oh my god .after watching your video I am getting confident. I felt like nothing is there in coding
@freeman372 жыл бұрын
Very good explanation and tutorial on time efficiency.
@anshbagde65443 ай бұрын
Really good explanation
@swatiomar86033 жыл бұрын
Best explanation.... I am looking for such tutorial.... Thanks :) and keep it up...
@chiragsharma62613 жыл бұрын
The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array? ***How the answer comes out to be 4.*** Detailed explanation would be appreciated.
@rajasekharguntreddi5 жыл бұрын
Best presentation I have ever seen
@anjalii11023 жыл бұрын
Thanks for such depth explaination
@SmartProgramming6 жыл бұрын
awesome tutorial sir, thank you 👍👍
@payalparmar_5 жыл бұрын
The way u explain the algo is awsm!
@Touhid_CSE8 жыл бұрын
Thanks, this tutorial is realy good. but i think there is a little mistake in first loop where the value of 'k' will be 0 (zero). plz check this input : 1 3 2 5 4
@ashianagi3 жыл бұрын
Will the time complexity in the best scenario still be n if we don’t add the flag condition?
@fasihurrehman86733 жыл бұрын
Excellent explanation ♥️♥️
@archanareddy53104 жыл бұрын
I have a doubt at 6:55 (n-1) *(n-1)*c=cn2+2cn+1 or cn2+2cn+c
@redtree732 Жыл бұрын
This is an amazing video. Bravo.
@keitasshi4 жыл бұрын
How to count primitive operations in the coding? Where to add the counter to count the primitive operations?
@ChipSqueax4 жыл бұрын
There's a clear explanation to your question on my video here! kzbin.info/www/bejne/emXIgqd9a7plZ6c. If you want a detailed explanation, here's another video I made:kzbin.info/www/bejne/bqS5h3WXe55sftE
@augustadjurnic1707 Жыл бұрын
Thank you for your nice explanation
@jalpacj78134 жыл бұрын
Nice explanation!ur voice is osm😅
@MuhammadRaqiburRahman2 жыл бұрын
Thank you for the efficient lecture.
@rickydonne8024 жыл бұрын
Hi ! Shouldn't the bubble sort algo in C look like this: void bubblesort(int A[], int n) { int k, i, flag, temp; for (k = 1; k < n; ++k) { flag = 0; for (i = 0; i < (n - k); ++i) { if (A[i] > A[i + 1]) { temp = A[i + 1]; A[i + 1] = A[i]; A[i] = temp; flag = 1; } } if(flag == 0) break; } } k in the video ran till n - 1, but it should run till nth element if the last element is the lowest.
@sumanturkiya43426 жыл бұрын
Nice explanation but one request it would be better if you give some more knowledge about the algorithm for example which one is best in this case, which is best of all, less time taken increasing order algo etc please tell about all this things as well thank you
@alzyl62876 жыл бұрын
This is very useful video and easy to understand
@tonyflow62445 жыл бұрын
I get that this is very old now but surely the time expression is cn^2-2cn+c rather than cn^2-2cn+1. Anyway, was helpful thanks.
@Codahat6 жыл бұрын
Excellent explanation
@RutulRavalLDRP10 жыл бұрын
Subscribed after looking only one video. Awesome explanations.
@Red-bb6qj8 жыл бұрын
Indexes counter in the for loop should all start from 0 and both should use n - 1.
@VenkateshNair8 жыл бұрын
yes...u are right
@ravibisla11 жыл бұрын
for inner loop t(n) should be C*(n)*(n-1) where n-1 is from outer loop and n is from inner loop itself?
@rishabhpatel52218 жыл бұрын
k should start from 0 otherwise n-k-1 will yield corrupted values
@kranthikiran37137 жыл бұрын
WHY? :/
@kranthikiran37137 жыл бұрын
K. got it. Thx.
@yogeshtiwari40585 жыл бұрын
Sir, in best case analysis, the inner for loop runs (n-1 ) time and outer pass loop runs only 1 time. But you said inner loop runs once?
@mattagab27175 жыл бұрын
Big O(n-1 + n-1) => big O(2n-2) => big O(2n) => big O(n) for best case
@alerioreyhan73074 жыл бұрын
thanks bro, this is so helpful
@midnightloner-z9o Жыл бұрын
if a already sorted array is given, then time complexity will be O(1) ryt, why O(n)
@archanareddy47746 жыл бұрын
Very nice explanation sir...
@ManjeetSingh-ee4zk8 жыл бұрын
BEST EXPLAINATION !
@aviroxi4 жыл бұрын
thank you so much for this series
@ryanimperial6518 жыл бұрын
What if the number in the first position is higher than the second position?
@akshayjain47779 жыл бұрын
Feeling lucky to have found your channel!!!! Subscribed :D
@competitivetopic80966 жыл бұрын
how can you change n-1 to n-2 after sorting 7(last element) it makes me confuse and the code didn't go to the last index for(i=0;ia[i+1]) { swap(); } } in this when i=4 in the size of array 6 (4