The bubble sort

- [Instructor] Let's begin by examining…one of the most basic sorting algorithms…called the bubble sort.…And I'll get more into why it's called that in a moment…but first, let's take a look at how it works.…So suppose we had an array of numbers like this.…The bubble sort begins by comparing the first two elements…to each other to see which is larger.…If the first element is larger than the second,…then the two elements are swapped.…Then the algorithm advances to the next slot…and performs the same comparison…and again, swaps the values if the first one is larger.…

So this process continues until we've examined…all the items in the array…and the largest value has made its way to the top.…And that's why it's called the bubble sort.…The values bubble their way to the top of the array.…So after the largest value is in place,…the process then starts all over again,…but now, we only examine the elements…up to the one before the last item…and then the one before that and so on,…until the array is fully sorted.…So, let's take a look…