The Geek’s Guide to Sorting Algorithms: Bubble Sort
Welcome to the first post in our new series, The Geek’s Guide to Sorting Algorithms. In this aptly named series we will be taking a look at a number of sorting algorithms, talk a bit about their performance, and look at an example implementation of the algorithm in Java. We will be starting with the most simple and inefficient of sorting algorithms, but we will quickly work our way up to more advanced, efficient algorithms.
In the first installment of this series we will be taking a look at an algorithm known as bubble sort. This is by far the simplest of the sorting algorithm, but it is extremely inefficient and just won’t cut it for any series data sets.
(I recommend that you watch the video on youtube in HD).






