>>> bubble_sort([1.1, 3.3, 5.5, 7.7, 2.2, 4.4, 6.6]) [1.1, 2.2, 3.3, 4.4, 5.5, 6.6, 7.7] ...
// sortStack runs for each of the n elements. // Each call pops one element and eventually reinserts it. // insert in the worst case may traverse the entire current stack to find the right place for ...