Learn Bubble Sort in 7 minutes 🤿

Data structures and algorithms bubble sort tutorial example explained
#bubble #sort #algorithm
// bubble sort = pairs of adjacent elements are compared, and the elements
// swapped if they are not in order.
// Quadratic time O(n^2)
// small data set = okay-ish
// large data set = BAD (plz don't)
music credits 🎼 :
===========================================================
Twelve Speed by - Slynk • Slynk - Twelve Speed (...
===========================================================
Up In My Jam (All Of A Sudden) by - Kubbi / kubbi
Creative Commons - Attribution-ShareAlike 3.0 Unported- CC BY-SA 3.0
Free Download / Stream: bit.ly/2JnDfCE
Music promoted by Audio Library • Up In My Jam (All Of A...
===========================================================

[@BroCodez]

public class Main{

// bubble sort = pairs of adjacent elements are compared, and the elements
// swapped if they are not in order.

// Quadratic time O(n^2)
// small data set = okay-ish
// large data set = BAD (plz don't)

public static void main(String[] args) {

int array[] = {9, 1, 8, 2, 7, 3, 6, 4, 5};

bubbleSort(array);

for(int i : array) {
System.out.print(i);
}
}

public static void bubbleSort(int array[]) {

for(int i = 0; i < array.length - 1; i++) {
for(int j = 0; j < array.length - i - 1; j++) {
if(array[j] > array[j+1]) {
int temp = array[j];
array[j] = array[j+1];
array[j+1] = temp;
}
}
}
}
}

[@andreamixvlog7478]

Hello, can i get this code?

[@joyceasante8292]

Practicing...
Ascending order
public class Main
{
public static void main(String[] args) {
int array[] = {7,3,2,1,4,0,8,6,5};
bubbleSort(array);
for(int i: array){
System.out.print(i);
}
}
public static void bubbleSort(int array[]){
for(int i = 0; i < array.length - 1; i++){
for(int j = 0; j < array.length - i -1; j++){
if(array[j] > array[j + 1]){
int temp = array[j];
array[j] = array[j+1];
array[j+1]= temp;
}
}
}
}

}
*************************
Descending order
public class Main
{
public static void main(String[] args) {
int array[] = {7,3,2,1,4,0,8,6,5};
bubbleSort(array);
for(int i: array){
System.out.print(i);
}
}
public static void bubbleSort(int array[]){
for(int i = 0; i < array.length - 1; i++){
for(int j = 0; j < array.length - i -1; j++){
if(array[j] < array[j + 1]){
int temp = array[j];
array[j] = array[j+1];
array[j+1]= temp;
}
}
}
}
}

[@koinahotahai]

​@@andreamixvlog7478yeah you can get it

[@dhoneybeekingdom7889]

The comparison with the two cups was really intuitive! I wish someone had explained me variable swapping with that example.

[@jaykay8426]

Out of all the basic ways of sorting, this is the slowest of the basic ways to sort

[@ashmikanln3110]

U r videos are my go to for all the sorting algos, Thank you for making these, Great help, Keep up the great work!

[@drpwnage23]

These videos are great. Really helpful for my studying, thank you

[@poromoro2414]

legit only channel I have notifications on for, lifesaver!

[@BroCodez]

thanks Poromoro! I'm glad these videos are helping

[@GamingPro-xn4hy]

Bro is the best when it comes to explaining. I hope this guy blows up all over yt. I will support him

[@thainguyenviet3267]

always waiting for your video !!! keep doing this , love u

[@BroCodez]

Thanks! I will continue

[@moum.a8130]

Bro you are just amazing , i really appriciate your works .. Please keep going

[@BroCodez]

thanks for watching!

[@user-pd9yp7ru4x]

You are saving my life in cs classes. Thank you so much.

[@BroCodez]

sweet! I'm glad the videos are helping!

[@barelycodingtoday]

I still come back to this video from time to time to rehash my BubbleSort.
Thanks BRO!

[@aleacevedo1016]

As always... excellent videos! Thanks!

[@user-dx2zs9bi5j]

Great Video mate!

[@sahinyusifli9756]

Thank you. It was so helpful!!

[@aliiiccyee5736]

I love u!!!! Thank u for making the concept so clear n understandable💝

[@dankmemequeen9581]

Thank you very much bro, you put so much time and effort into your videos!

[@Viva-Crusader]

Great explanation, thank you so much.

[@plankalkulcompiler9468]

Very helpful video, thank you!

[@leonardopensador]

I'm watching your videos from Brazil and I want to thank you for taking the time to teach us. It was very didactic to understand your explanation. Thank you very much.

[@Tomteluva82]

very useful, thanks!

[@T-Rex0711]

Defeat the algorithm, Bros.

[@BN-cr3el]

💯 thank you!

[@MohammadJavadd]

Really can't be better than this, thanks so much it was great tutorial❤❤

[@qwikz5389]

this helped me out thank you

[@BroCodez]

Thanks for watching Qwikz!

[@aditya_asundi]

you are great, just 15k subs away from the milestone! congrats

[@BroCodez]

Yeah that's coming up soon!

[@junialdy]

thank you for the video, very easy to understand with your explanation

[@bagnotneeded]

you are a truly gigachad... really golden video. keep going!

[@sadman6852]

Thank you bro!

[@codeammar]

thx man for the amazing video , I wanted to note that since the inner loop has 8 elements to be compared and the last element won't get compared because the second element then will already be sorted, so for that the outerloop should be array.length - 2 right ?

[@dharmeshajudiya1709]

Good explantation, Thanks for sharing

[@Omar-_-_]

Amazing, thanks alot

[@jacklagos936]

Many thanks!

[@johnhansen4794]

Clear and Concise. Thanks.

[@BroCodez]

Thanks for watching John!

[@aaronfernando5300]

Ey Brooooo ... i love you man ... not even my uni lecturer explained sorting this well .. saw this video 1 day prior to my exam and it helped meee soo much.. really appriciate BROOO ..Much Love from Sri Lanka ❤

[@jerrypolemica2704]

Thanks from Italy!

[@user-xm5jw7oo5g]

great man

[@Cristian-me9id]

thank you (:

[@youcefmantas4944]

Thanks Mate!!

[@nikitos2442]

Like always...legendary!

[@BroCodez]

Thanks Nikitos!

[@IsaacAwad.04]

thanks man

[@xeahmedrefat2972]

Thanks from Egypt❤‍🔥

[@andres9108]

I'm from Colombia and I can understand all with this video, thx u (I love the manual example)

[@MrLoser-ks2xn]

Thanks!

[@muhammed__5]

very well done!

[@wolfskind9135]

You're really saving my ass studying for that computer science exam - thanks bro!

[@ThEHUNtErCr9]

Really helpful video. I could not understand the concept of bubble sort before but now i do and it has helped me code my programs better thanks bro

[@user-do3tq9gu3h]

thank you!

[@CSstudent_1001]

Thank you

[@yehannk448]

Bro thanks just what i was looking

[@BroCodez]

awesome! Thanks for watching Yehan!

[@admoonhermiz1]

thank you!!!

[@Anonymationsthecoolanimator]

I know it already but I appreciate your effort. I currently know bubble sort, selection sort, insertion sort, binary and linear search as per my school syllabus. I will be waiting for your quick sort tutorial, I seriously want to learn it.

[@BroCodez]

quicksort will be coming up soon I believe

[@_4p_]

it was perfect.
all of it

[@Snowmanver2]

Bubble sort is a very easy algorithm to implement, but is quite inefficient with large data sets

[@matinmonshizadeh]

thanks bro :D

[@MeditateRelaxEtcetera]

You've got it sorted out.😎

[@TITAN-sv5eg]

thanks for clarify this

[@DanielSmith-uj7rr]

Thank You Bro! YOU ARE GREAT MY FRIEND! (People who dislikes are not from Computer Science background! LOL)! Well, I'm comfortable in Python programming. So, I didn't watch your Java code. But, your explanation is so perfect that it was building an easy understanding about the algorithm. So nicely explained! Bro, Do you also solve leet code problems?

[@wallstreetbets7741]

Learnt thx

[@iamfromasean705]

Thank you for the algorithm!

[@BroCodez]

Thanks for commenting to help with the UA-cam algorithm!

[@iamfromasean705]

@@BroCodez Bro, can you do quick sort , please?

[@Poria_q]

You're the best

[@joelpose7269]

i dont understand the "J" loop, why do you substract "i"? could someone explain pls

[@cashionsteven5695]

holy moly, way better than my professor lol :))

[@autosuggestionasshole9208]

the best channel on youtubeeee

[@BroCodez]

Thanks bro!

[@user-eh3zv9pv1z]

Thanks

[@indigo_diary]

than you!!

[@MaRvELsNERD]

Bro is the goat 🐐

[@mayarmosleh9484]

Nice

[@Remolhunter97]

Perfect 👌🏼

[@BroCodez]

thanks Remol!

[@mohamedabdirizakahmed3539]

thank you so much, it makes me easy, cause I watched alot of tutorials but don't understand.
yesterday I bought a C# course on udemy, the first video is talking how to make a Bubble sort, but i don't understand.
then my mind said: go on yotube, may be you can find a good teacher that makes simply to this fucking Bubble sort.
then i got you.
Now i understand the Bubble sort.
thank you so much..

[@LoveTaiwan678]

Thank you ;)

[@BroCodez]

thanks for watching Yu!

[@sakuriosky1573]

For the second for-loop
for(int j = 0; j < array.length - i - 1; j++)
Why must we subtract i and one? I understand why we need to subtract one but why i?

[@jellojoy2977]

I know it's kind of late, but I'll reply anyway in case someone has the same question. We subtract i, so that way we won't check the numbers that are already sorted!

[@JakeD21]

Legend.

[@learner8005]

New bro here loved you video brooooo🤘🤘🤘

[@vehanhemsara9793]

Thank You

[@BroCodez]

Thanks for watching Vehan!

[@vehanhemsara9793]

@@BroCodez 😊❤

[@kyawsanaung2019]

Thank you for your video. I think you need to break the loop if the array is already sorted for efficiency.

[@gabrielcasanova7034]

Hey! bro or guys, why are u using a nested loop? still didnt get it

[@chefskiss651]

What should I do if I'm dealing with a large data set?

[@genesiscereno5106]

tHank you broooo

[@Dumb4Creepy]

can someone help me... why is it that we use " i < array.length - 1 " coz "

[@youssofprogrammer7546]

amazing

[@jdserrato3792]

I will savour this moment that does not involve recursion

[@sakiszintros7782]

hi.can you start from the end of the table to compare the elements or is it wrong?(Python)

[@abdulmoiz5311]

Great video! Please explain QuickSort , Heap and Binary Trees!!

[@BroCodez]

Thanks Abdul! We'll get to those topics eventually!

[@MohitRaj-1712]

you deserve more subscribers.

[@BroCodez]

thanks Mohit!

[@embodormo7398]

Thanks for video

[@BroCodez]

np! Thanks for watching EMbo!

[@official_ardi4840]

Yo bro i understand the code but something that i missing is
How can we scan from the beginning again after we scanned all the array? I still didnt get it

[@jessicabull3918]

is each lap the same as an iteration?

[@inspired12121]

hey you, thank you

[@tronganhnguyenthanh1157]

I have a mathmetics like that:
let text = "AAAABBCCCDA"
how do you convert this one to 4A2B3C1D1A" ?

[@julianrobinson2848]

Why do we need the temp variable?

[@meetprotrash3178]

I love you bro thanks 😘💙❤️😘

[@BroCodez]

THanks bro!

[@wolanus]

Great video

[@BroCodez]

Thanks Michal!

[@alinaseerideas2295]

Great job..
Please Start complete video series on node KS as back-end technology..

[@BroCodez]

maybe! I'll let you guys vote on future topics when I release polls

[@elbioiseas7366]

Good video explanation of the Bubble Sort algorithm. Would it be possible to make a video of binary tree algorithm with the different ways of visiting the tree structure plus how to insert, delete and search for a node in the tree? It would be very educational. Thank you.

[@BroCodez]

I'm planning binary trees for a future video

[@geografixxxx]

Very easy to understand, but I wish u made those tutorial in C.

[@envektro2519]

can you do this for every sorting algorithm? thanks in advance

[@BroCodez]

I'll try

[@majdkinani587]

Me watching this as i have an exam tomorrow (im saved by this chad)

[@NormaNsNs]

what does it mean j

[@amkiji2992]

I Hope you can do a PHP cours i Really like the way that you teach you are amazing

[@BroCodez]

maybe! I'll let you guys vote on future topics

[@aleksandarduncevic9548]

Great videos, you are very helpfull! One question, in second for loop, can we write "int j = i" instead of 0, because we do not want to compare elements that are already sorted?

[@poparobertandrei1698]

he already does that
but its not the first i elements that are sorted
its the last i