Learn Bubble Sort in 7 minutes 🤿
ฝัง
- เผยแพร่เมื่อ 26 ก.ย. 2024
- 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...
===========================================================
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;
}
}
}
}
}
Hello, can i get this code?
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;
}
}
}
}
}
@@andreamixvlog7478yeah you can get it
The comparison with the two cups was really intuitive! I wish someone had explained me variable swapping with that example.
You are saving my life in cs classes. Thank you so much.
sweet! I'm glad the videos are helping!
Out of all the basic ways of sorting, this is the slowest of the basic ways to sort
These videos are great. Really helpful for my studying, thank you
U r videos are my go to for all the sorting algos, Thank you for making these, Great help, Keep up the great work!
legit only channel I have notifications on for, lifesaver!
thanks Poromoro! I'm glad these videos are helping
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.
quicksort will be coming up soon I believe
Bro is the best when it comes to explaining. I hope this guy blows up all over yt. I will support him
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?
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!
we subtract 1 so there wont be overflow from the array. You can avoid using -1 by doing the following steps: 1) start the j-loop from 1. 2) when you do comparison, you do arr[j-1] and arr[j] comparisons. Using this version of the loop might be more intuitive to understand.
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.
Bro you are just amazing , i really appriciate your works .. Please keep going
thanks for watching!
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..
Bubble sort is a very easy algorithm to implement, but is quite inefficient with large data sets
I'm from Colombia and I can understand all with this video, thx u (I love the manual example)
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
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 ❤
Defeat the algorithm, Bros.
Really can't be better than this, thanks so much it was great tutorial❤❤
you are great, just 15k subs away from the milestone! congrats
Yeah that's coming up soon!
I still come back to this video from time to time to rehash my BubbleSort.
Thanks BRO!
I had been looking for bubble sort written in basic. I found BBC2 book with a sample program, but the code was messy.
I managed to make easy to understand and I use it for personal applications. Like statistics.
A list of names and their statistics - e.g. (height, weight, age ) and put in order by any list.
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?
always waiting for your video !!! keep doing this , love u
Thanks! I will continue
Thank you for your video. I think you need to break the loop if the array is already sorted for efficiency.
all I keep hearing is bulbasaur 😆Thanks for the video!!
Thank you very much bro, you put so much time and effort into your videos!
💯 thank you!
You're really saving my ass studying for that computer science exam - thanks bro!
you are a truly gigachad... really golden video. keep going!
thank you for the video, very easy to understand with your explanation
this helped me out thank you
Thanks for watching Qwikz!
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 ?
i dont understand the "J" loop, why do you substract "i"? could someone explain pls
Thank you. It was so helpful!!
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?
he already does that
but its not the first i elements that are sorted
its the last i
Thank bro code you is my hero about progamming thanks bro
Great explanation, thank you so much.
Hey! bro or guys, why are u using a nested loop? still didnt get it
As always... excellent videos! Thanks!
Thanks from Egypt❤🔥
Everyone does not share information's easily and free, mostly want money, Thanks for sharing free INFORMATIONS BRO
no problem! Thanks for watching Saber
Thanks from Italy!
I will savour this moment that does not involve recursion
Very helpful video, thank you!
Clear and Concise. Thanks.
Thanks for watching John!
Good explantation, Thanks for sharing
I am happy to announce that I will be building a complementary video series (Algorithmic Complexity Analysis) that analyzes many of the defined concepts within your talks to demonstrate it using a rigorous mathematical framework that describes algorithms on a meta-level and forms the perfect combination, when watched in conjunction with your video series
Hello brother :)
Hi
Hey Duckers!
Great Video mate!
very useful, thanks!
Explanation of j< array.length-i-1 ? please...
After the first iteration the highest number will ended up in the highest position. so, in the next iteration we don't need to check again for that number (he's at the right position).
After the second iteration the second highest number will ended up in the second highest position, so we don't need to check again for that number or the number in the highest position.
And so on for the rest of the iterations.
Many thanks!
Thank you bro!
can you do this for every sorting algorithm? thanks in advance
I'll try
Very easy to understand, but I wish u made those tutorial in C.
Great video! Please explain QuickSort , Heap and Binary Trees!!
Thanks Abdul! We'll get to those topics eventually!
why is it j
Me watching this as i have an exam tomorrow (im saved by this chad)
the best channel on youtubeeee
Thanks bro!
Bring on modules in python pls bro sir
Like making tools automation etc
Bro thanks just what i was looking
awesome! Thanks for watching Yehan!
thanks man
You've got it sorted out.😎
DROP a COMMENT for this awesome video.
very well done!
Amazing, thanks alot
thank you!
Thanks Mate!!
Thanks!
Like always...legendary!
Thanks Nikitos!
thanks for clarify this
thank you!!!
Thank You
Thanks for watching Vehan!
@@BroCodez 😊❤
it was perfect.
all of it
hi.can you start from the end of the table to compare the elements or is it wrong?(Python)
Great job..
Please Start complete video series on node KS as back-end technology..
maybe! I'll let you guys vote on future topics when I release polls
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.
I'm planning binary trees for a future video
can someone help me... why is it that we use " i < array.length - 1 " coz "
I have a mathmetics like that:
let text = "AAAABBCCCDA"
how do you convert this one to 4A2B3C1D1A" ?
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array.length - 1; j++) {
if (array[j] > array[j + 1]) {
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
This code worked for me. Why? My second for loop doesn't subtract i from array.length.
another simple implementation of bubble-sort algorithm
public static void bubble(int[] arr) {
int temp;
for(int i=0; i
you deserve more subscribers.
thanks Mohit!
Thank you
New bro here loved you video brooooo🤘🤘🤘
holy moly, way better than my professor lol :))
I Hope you can do a PHP cours i Really like the way that you teach you are amazing
maybe! I'll let you guys vote on future topics
thank you (:
I love you bro thanks 😘💙❤️😘
THanks bro!
great man
Thank you ;)
thanks for watching Yu!
Learnt thx
Thanks
than you!!
Hey bro, Python data structures and algorithms would be awesome 🔥🔥
maybe in the future, most of my viewers wanted Java
Thanks for video
np! Thanks for watching EMbo!
You're the best
Hey bro, can you start data structures and algorithms using python please?
maybe in the future, most people wanted Java
Introduction for me😂😂😂😂
Ohhh yeah😾🎭🎭🎭🎭
Nice