Sorting algorithms are some of the earliest that you typically get exposed to in Computer Science. It may not be immediately obvious how important they are, but it shouldn’t be hard to think of some examples where your computer needs to sort some massive datasets during everyday operations.
One of the simpler (but more processor-intensive) ways of sorting a group of items in an array is bubble sort, where each element is compared to the one next to it and they are swapped if the one on the left is larger than the one on the right. This continues until the array is eventually sorted.
There’s also an entry on Bubble Sort on Wikipedia that’s worth taking a look at.
- Build a method
#bubble_sortthat takes an array and returns a sorted array. It must use the bubble sort methodology (using
#sortwould be pretty pointless, wouldn’t it?).
> bubble_sort([4,3,78,2,0,2]) => [0,2,2,3,4,78]