Bubble Sort Algorithm | Java | Python | Javascript

In this video you will learn how to implement the bubble sort algorithm using Java, Python and Javascript.

Data structures and algorithms is a must if you want to become a real software engineer.

It tough not gonna lie, but I got your back

🙊 Here are the goods for all my videos video:

► Recommended Books

Clean Code

HTTP: The Definitive Guide

Clean Architecture

► Computer and Monitor

New Apple MacBook Pro

Dell 27 INCH Ultrasharp U2719D Monitor

Double Arm Stand Desk Mount

USB C Hub Multiport Adapter

► Camera Gear

Sony ILCE7M3B Full Frame Mirrorless Camera

Sigma 16 mm F1.4 DC DN

Sigma 33B965 30 mm F1.4 DC DC

Awesome Screen Saver

IDE I use for coding
- Iterm
- VsCode
- GoLand
- IntelliJ
- Sublime

💯 You can also follow me here:

Channels I recommend to learn how to code

❤️ Thanks for watching

#coding #bubblesort #algorithms

[helaolange]

Please upload more videos about *Data Structures and Algorithms*

[hubbiemid]

Make more data structures and algorithms vids, this was one was super helpful!

[Alex-Ora]

Just started watching your videos, grateful to have people like you, thanks for all the things you share!!

[ericcourville]

I didn't just click like, I freakin' SMASHED it!

[abubakarlawwal]

We need more of these kind of videos pls.🙏

[midasama]

I know it must be pretty intuitive for you at this point, but it would have been great if you could have spoken a little bit about the time and space constraints we face by implementing this algorithm. Maybe you can take into account for the next videos in this series. Apart from that, nice video! Thanks for the effort.

[jaime]

I love this channel, high quality and well explained!!

[treeteqs]

very clean, very beautiful representation of the algorithm... thank you

[simoncodinasanchez]

At the end, in pyhton, I think that there is a mistake, it is necessary other line code; if list[j] > list[j+1]: like that:
list = [6, 4, 5, 9, 3, 2, 1]
print(list)
for i in range(0, len(list)-1):
for j in range(0, len(list) -1 - i):
if list[j] > list[j+1]:
list[j], list[j+1] = list[j+1], list[j]
print(list)

[belkocik]

would love to see more videos on algorithms with JavaScript c:

[raphaelperissato]

Thanks for the video! Just to add the if statement:

list = [11, 20, 53, 78, 41, 65, 8, 95, 13, 5]
print(list)

for i in range(0, len(list) -1):
for j in range(0, len(list) -1 -i):
if list[j] > list[j+1]:
list[j], list[j+1] = list[j+1], list[j]
print(list)

[guitarman]

Even though I'm familiar with Bubble Sort, (the worst sorting algorithm out there), this video was a very good explanation of the algorithm. Even if commercially and in interviews, this algorithm should never, ever be used!!
Looking forward to your upcoming Data Structures and Algorithms course, Nelson. I sadly only know the worst algorithms at the moment! :-P

[KrishnaYadav-zuoz]

Very useful . Now my bubble sort concept clear thanks brother .
Please upload more small videos on data structures .its easy to learn and its not take much time 😀😀

[rahulpatil]

More data structure and algorithms please. I really like the way you explain.

[emadmohamed]

You are amazing in explain
Your explain is fantastic 💗

[husein_alfil]

Would you like to do more videos about algorithms ?
Thank you in advance !

[chabdullah]

upload more videos on Data Structures and Algorithms
in Javascript

[gentlesouls]

Damn you are Good!!! Smashing the like button!!!

[daddy]

cool bro iam one of your subcriber from uzbekistan

[dhoops]

Very good content, can't wait for the next video on algorithms.