Implementing the bubble sort algorithm

In this section, we are going to implement the bubble sort algorithm. To recap our sorting algorithm overview, the bubble sort algorithm sorts a collection by moving from left to right, comparing a value with the next value to determine which value is higher (or lower depending on the goal). Typically, it iterates through the entire list many times in order to properly sort a collection. As mentioned in the previous section, bubble sort is not effective for real-world programs because it's too slow.

Bubble sort code example

We'll start off by creating a method called bubble_sort that will take array as an argument:

def bubble_sort(array)
  n = array.length
  loop do
  end
end 

Next, we assign the length of array to a variable called n. From there, we create a loop to iterate through the entire array. In this case, we're going to use the generic loop mechanism, which operates very much like a while loop. Inside loop, we check the value of each element and...