Answer TRUE or FALSE.
Bubble Sort (as the code is written in this module) is a stable sorting algorithm. Recall that a stable sorting algorithm maintains the relative order of records with equal keys.
Remember that: Bubble Sort consists of a simple double for loop.
The first iteration of the inner for loop moves through the record array from bottom to top, comparing adjacent keys.
If the lower-indexed keys value is greater than its higher-indexed neighbor, then the two values are swapped.