Because a one-dimensional array organizes data into an indexable linear list, it's the

perfect data structure for sorting. As you may know, there are a number of different
sorting algorithms. There are the quicksort, the shaker sort, and the shell sort, to name
just three.

However, the best known, simplest, and easiest to understand is called the Bubble sort.
Although the Bubble sort isn't very efficient — in fact, its performance is unacceptable for
sorting large arrays — it may be used effectively for sorting small arrays.
The Bubble sort gets its name from the way it performs the sorting operation. It uses the
repeated comparison and, if necessary, exchange of adjacent elements in the array. In this
process, small values move toward one end and large ones toward the other end. The
process is conceptually similar to bubbles finding their own level in a tank of water.

The Bubble sort operates by making several passes through the array, exchanging out-of-
place elements when necessary. The number of passes required to ensure that the array is
sorted is equal to one less than the number of elements in the array.
To sort small arrays using the Bubble sort, create a file called Bubble.java.
Here's the code that forms the core of the Bubble sort. The array being sorted is called
nums.

Notice that the sort relies on two for loops. The inner loop checks adjacent elements in
the array, looking for out-of-order elements. When an out-of-order element pair is found,
the two elements are exchanged. With each pass, the smallest of the remaining elements
moves into its proper location. The outer loop causes this process to repeat until the
entire array has been sorted.
Here's the entire Bubble program:
Here is the output from the program:
Summary

In this lesson, you learned to use the Bubble sort to sort small arrays. You learned that the
Bubble sort, using two for loops, makes several passes through the array and exchanges
out-of-place elements when necessary.