Bubble Sort in 2 min (Python)
Hi everyone! In this video, I will explain bubble sort with two easy examples with input arrays. Then, I will go through the code of bubble sort with Python.
Bubble sort is one of the easiest algorithms used for sorting numbers in an array. It has the worst case time complexity of O(n^2), where n is the size of the array to be sorted. Pretty much all computer science students will learn to sort through numbers in the Data Structures and Algorithms course, just like bubble sort. However, it is not the fastest sorting technique, as quick sort is way more efficient and faster.
In the next video, I will go over selection sort, insertion sort, then merge sort, and finally quick sort, respectively. The interesting thing is that bubble sort is actually the opposite of insertion sort. So stay tuned!
Please leave a like and subscribe if you found this video helpful!
See other sorting algorithms in my Data Structure and Algorithms playlist: • Data Structures & Analysis of Algorithms
LIKE & SUBSCRIBE:
🔴 My Channel: / quocdatphung
🔴 My second channel: / @purifynature8479
MY EQUIPMENT:
✅Camera: Samsung Galaxy J7
✅Recording Equipment: https://obsproject.com/
✅Editing Software: Shotcut
