Bubble sort in 2 minutes

[@istiaqahmed8309]

After completing a 30 minutes lecture on the topic this video is like a dessert after dinner.

[@SzechSauce]

These videos are great, 30mins of my lecture summarized in 2mins lol

[@pxolqopt3597]

30 minutes to explain bubble sort? Really?

[@prometheus-naturalscience9371]

@@mtosity Usually a CS lecture on something like this would also include proofs for correctness, and time and memory complexity. Dont think it adds up to 30 minutes, but its obviously a lot more than what is shown here, which basically just the idea of the algorithm and an example.

[@tanveebandi1090]

True😂

[@AnkurSingh-uc7gz]

In min😂 2X

[@100_focus]

wait u guys are learning this in uni???

[@r0btaylor]

I only recently found your channel and I'm finding your style and clarity to be especially effective for my learning. Just wanted to let you know how much I've been appreciating your content. Thanks!

[@MichaelSambol]

I appreciate you watching, thank you!

[@kewtomrao]

His two minutes of silent teaching was better than an hour of our lecturer's class.

[@realwizardry834]

Love this visual way of learning. Thank you for the work put into this

[@lucutes2936]

ye

[@abzinhoo]

Ah

[@lukebrown2498]

Hello, i'm a student from the UK and my course requires me to learn a lot of the sorting algorithms that you have shown. Usually, only resources from people specifically covering the course is helpful, but these visual aids have been really effective and engaging, so thanks so much

[@MichaelSambol]

glad the videos helped! thanks for the note.

[@ronitmehta2594]

I am a visual learner so I found this extremely helpful!

[@ichoosemeimsorry]

lmaoooo i cant believe i managed to understand what i have been struggling with the whole semester in 2 minutes. thanks man

[@omersakkar5670]

Thanks for the explination. I wanted to point out that you can right much more effecient code: for i = 0 to n-1 for j = 0 to n-i-2 if array[j] > array[j+1] swap(array[j], array[j+1])

[@ravs]

Very simple and concise way to explain this algorithm. Keep up the good work and looking forward to more videos.

[@Raum_Raum_Raum_Raum]

Shush bitch

[@Krokodil986]

amazing video - short, precise, and explains very well

[@eeevoo]

@@Raum_Raum_Raum_Raum damn why so toxic

[@陳致揚]

I have watched your all videos several times whenever i need to review the algorithm, " You Are Definitely A God Of Algorithm"

[@romysasiddiqui2859]

you're videos are more helpful than other videos that are 30 to 40min long and yet at the end still are confused.

[@valvarexart]

Very nice and to-the-point videos, thank you! A small note: bubble sort would perform better if n was decreased after each iteration (reflecting the fact that the last element is in its final position) and if we keep track of whether swaps have been made or not during a round (if not, we can just terminate).

[@stefanjovanic7725]

I was looking for this explanation that's how simple it is for some people. Two sentences to explain what is going on.

[@shalev1234]

And I think also every even iteration a bubble of small elements to the left will be good for a case that a small element is on the right side of the array.

[@jliu66-p1q]

the best optimization is setting your outter loop stop index to be the last swapped index of your inner loop. This makes it more naturally adaptive than keeping track of a swaps made boolean

[@manmeh4r]

now THIS is the best bubble sort guide ever

[@farhatzuhair7729]

Thanks, I cleared my exam easily by watching this

[@techytech07]

Thanks for a clear and simple video! It's Helping for my GCSE this May. Some people just overcomplicate these sort methods.

[@NB20LOL]

Very helpful, have a test in 2 days and know almost everything on this topic

[@hydhexane]

i have exam tomorrow, this video helped me revise bubble , thanks

[@MichaelSambol]

crush it!

[@juicetime222]

I have an exam soon, this video really helped!

[@luke9524]

Incredible video, you're style of teaching is very easy to understand.

[@kerbe5374]

Bruh is this really what took my professor most of the class trying to explain😭 thank you so much for this

[@TheGugustar]

Best algo channel on youtube.

[@priyanshuagrawal9204]

Thankyou from saving me from watching 1 hour lecture, when I am in rush before exams

[@SniperFire274]

Best video I've seen to explain bubble sort, thank you!

[@chiragshilwant886]

According to your code, Number of comparisons is n(n-1) but it can be reduced to n(n-1)/2 by setting j upto n-i-1

[@ramviswanadhapalli4397]

i was thinking about the same thanks for the confirmation

[@FrenziedSol]

This animation absolutely made me understand the bubble sort

[@JohnWickXD]

This channel is underrated man!

[@HarunAltay]

Thanks Michael. Great job! But I guess pseudu code is wrong. It may be: for (int i = 0; i < array.length; i++) { for (int j = 0; j < array.length - 1 - i; j++) { if (less(array[j + 1], array[j])) exchange(array, j, j + 1); } }

[@piyushsahoo3636]

yes both are correct but yours is more optimized

[@nicolasrodriguez1499]

Thanks dude, this shorts videos are saving me for my algoritm exam! Thanks!

[@MuntahaZad]

Thanks! No music and no trash!

[@Pwnedby]

I literally coded it after u explaining it to me. This helped soo much!

[@roaamoustafa3488]

Hello, i just eant to thank you for you effort in this short videos I have adhd and I always find it so hard to understand CS concepts such as datastructers and long videos don't work for me at all also I am a visual learner so, I'm really thankful!

[@MichaelSambol]

you're welcome!

[@Ali-mi9up]

Those saying that pseudocodes is wrong are incorrect, you can have another implementation that's right too

[@vincenzocammilleri2907]

All your sort videos were awesome!!! Thank you so much bc I needed it for my final tmw lol

[@yikayiyo2920]

for i from 1 to N: # N-1 iterations to sort a N-length list for j from 0 to N-i: # after i iterations ,the last i elements are sored

[@UtshaKSaha]

This was such a good video, some things just need visualizations.

[@hakonaskildsen2602]

Thank you so much for amazing videos! Great repetition before exams.

[@secretnobody6460]

so much better than my 3 hour lectures

[@saddlepiggy]

Awesome videos, great refreshers before finals

[@MichaelSambol]

💪🏼❤️

[@VihaanKumar-o1s]

excellent explanation.........very simple and easy to understand

[@player-vo8yb]

i like these short vids to the point and no padding like those other shitty ass vids thank you kind sir

[@billionear]

Awesome simple and straight to the point - subscribed!

[@vendita2]

Thank u, didnt have time for big explanations

[@entruh4520]

Thanks man. Wish me luck for my test tomorrow

[@kingcookie3920]

the pseudocode works but I would do "N-i" instead of "N-1"

[@jesusbojorquez2252]

N - i - 1

[@kingcookie3920]

@@jesusbojorquez2252 why? i starts with 1. First round you need to compare 6 times. That is N-1 Second you compare 5 times. That is N-2 Overall you have to do this 6 times (Not an insult, I am probably just don't get it)

[@jesusbojorquez2252]

@@kingcookie3920 I wrote N - i - 1 because if you look at the second for it goes from 0 to N -1, so when j == N - 1 it will compare a[N - 1] with a[N] which doesn't exist in the array. "FIrst round you need to compare 6 times" yes that's right but remember that the second for start from 0 so you don't need to go to N-1 you just need to go to N - 2.

[@renzserilo7142]

Just an ordinary boy here just to read these comments, i’m not crazy to argue with a king specially with jesus.

[@svenwillett1750]

You're doing an advanced bubble pass, a normal one still does the rest even though you know the last is known.

[@random-0]

Best video on bubble sort

[@MohammadJavadd]

Finally understand it, thanks so much

[@monjasonsteng7861]

This was great. Thank you!

[@alexanderhearn6015]

I love having to put the video in 2x speed. This should be a 20 second video

[@MichaelSambol]

Go as fast as you need :) I talk slow.

[@radhikasoni8105]

Brilliant explanation!! Please make a video on Radix sort.

[@magickomchanell4556]

Very helpful thanks for the video!

[@sanadesai13]

@michael, Thanks for the video, but shouldn't the second FOR loop be "for j from 0 to N-2". i.e till the second last element. Because if it reaches "N-1" i.e the last element then j+1 = N which will give out of bound error.

[@RAHULTMNT100]

you are correct the values should be, i < nSize - 1 ( as i reaches nSize -1 , array will be sorted) j < nSize - i - 1 ( after i iterations, the last i elements are already sorted)

[@CephasTheWanderer]

Awesome. Short, sweet, simple

[@Erikuri]

Thank you! This really was helpful.

[@cg8770]

Nice video!! It helped me a lot

[@nirkiotaxy]

ООООО, НАКОНЕЦ Я ПОНЯЛ ЭТОТ МОМЕНТ!!! То, что при первом прохождении цикла, большее число однозначно отсортируется и будет стоять в конце массива, из-за чего можно не проводить последующие проверки с ним

[@evanspicolo6493]

Nice video! Helpped I lot to teach this

[@ettsoc9018]

great and efficient to learn like this

[@JamesBrodski]

Great video! Thank you so much.

[@FunnyOnes1xx]

this was very helpful, Thank you!

[@MichaelSambol]

De nada!

[@이석원-x9p]

I like colors you made.

[@lindamanas954]

Nicely done!

[@abdosalah22]

Great explanation!

[@Withmusclecutie]

Wouldnt it be more efficient if it didnt look at the number combos that didnt change

[@jeshmex]

Thank you so much, very helpful!

[@prashanthreddy1502]

The bubble sort method is a nice and simple method of sorting an array. It however looks to be very time consuming and inefficient as it would have to run almost as many times as the size of the array and it would be highly inefficient with larger arrays. #IISH11CSHLIC

[@midasredblade236]

prolly usefull in special cases

[@yblue6116]

you saved me, thanks a lot man

[@lukehatcher98]

Just what I needed!

[@mahdighasemi9518]

very good, thank you❤️👍

[@afaqa.s.9887]

Simply, awesome...

[@jamaicandjnado]

Perfection. Thank you.

[@minkymoo5773]

So bubble sort is a bit like the opposite of selection sort, isn't it? Since with selection sort, you have a sorted partition on the left at any given iteration, and with bubble sort you have a sorted partition on the right at any given iteration.

[@cravinghydra30]

Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order and it arranges them in increasing order.#IISH 11CSHLIC

[@nty449]

my teacher showed us this dumb ass dance thing and I was like WTF IS THIS GARBAGE. this is so much more helpful thank you. I actually get it now

[@NyashaMandizvidza-vp3do]

This is amazing

[@ReapeX]

Subscribed, thanks!

[@ricardoancona9722]

for an strange reason, running this pseudocode in python has a bug, I don't know why, but comparing 2 elements of the list, for example: 4>23, returns TRUE, because. it seems to be comparing only the first digit (4>2), I solved it by converting the current value and the next value to integer before comparing, does anyone know why this happens?

[@JuanArth378]

Thank you it was very helpful

[@Tim1-z6b]

Bubble sort Javascript code: function bubbleSort(arr) { for (let i = 0; i < arr.length; i++) { for (let j = 0; j < arr.length - i - 1; j++) { if (arr[j] > arr[j + 1]) { let temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } } } return arr; }

[@memenchance1747]

I know how to do the problem but I don't know how to tell the computer how long I want this process to continue. Do you have any suggestion of books to read or watch?

[@joebradley1239]

Great video! im doing GCSE computer science and i was just wondering what would an exam style question look like? would it simply ask to sort these numbers using a bubble sort (show your working) or breifly explain what a bubble sort does? thankyou

[@antoniojg-b8284]

In my experience, it's likely the first one.

[@ameliewolfbane7733]

One question might be what will the last two numbers be after the first iteration (the answer would be 1 , 9)

[@HabirRibah]

You're great. Thank you

[@iamusmanshabbir142]

Real Gem 💎

[@StewieGriffin]

Bubblesort is basically the MOST BASIC SORT EVER

[@ctoxyz]

humans hav voice for reason : nice work

[@sean_hare]

This psuedocode works, but it's literally doing twice the number of iterations it needs to, and this is wasteful code. It should be: For i = N-1 to 0 For j = 0 to i if a[j] < a[j+1] swap(a[j], a[j+1]) If after the first pass of j, the highest value in the array will be sitting in N. Knowing this, the second pass of j should terminate one space earlier, which will happen when i decrements toward 0.

[@mastermax7777]

shouldnt the second loop only go until N-i ?

[@shafaf1]

Simple and understandable

[@asagiai4965]

is it me or this is probably the slowest sorting algo? thanks for a more clear explanation

[@devops-k1p]

Currently done with 2h lecture, now time for 2h lab. Leave me alone bubble sort!

[@Jschmuck8987]

so, essentially, the worst case scenario is where it's already sorted but in reverse order, right?

[@riyamani8161]

#IISH 11CSHLIC The video helped me understand the process of bubble sorting and how the iteration works. It is a comparison of consecutive variables that gives the right form of number as the end result.

[@DeepankSingh-u4p]

Hi Michael. Which software do you use for the animations in your videos?

[@MichaelSambol]

Keynote and iMovie!

[@DeepankSingh-u4p]

@@MichaelSambol okay. Thanks.

[@amandasun6677]

Small typo: I believe in the pseudocode, the j loop should be from 0 to N-i

[@varunbe09]

From @interviewkickstart I learned that, Its start comparison from right to left. So second for loop, For j from N to i Everything looks similar but here heavy element sorted at right. And Interviewkickstart video , in every steps lighter elements sorted at left

[@lebogangsekwati4305]

God bless you!

[@adithyam3202]

im confused how you go from 1 to n and then from 0 to n-1. The smallest index in the array is 0, and the largest index in the array is n-1, right? so how can you go from index 1 to index n when index n does not exist?

[@kafychannel]

thank you so much!

[@tksnapz5003]

So helpful thank you!