Unworkable completion detection in a ruby bubble sort.

Bad Bubble Sort

def single_run_bubble_sort(data)
  i = 0
  while i < (data.count - 1)
    if unsorted?(data[i], data[i + 1])
      data[i], data[i+1] = data[i+1], data[i]
    end

    i += 1
  end
  data
end

def unsorted?(first, second)
  first > second
end

def bubble_sort(data)
  pre_sort = data
  p pre_sort
  post_sort = single_run_bubble_sort(data)
  p pre_sort

  until pre_sort == post_sort
    puts "this ran"
    pre_sort = post_sort
    post_sort = single_run_bubble_sort(post_sort)
  end

  post_sort
end

# workable sort, but time is always max
# def bubble_sort(data)
#   post_data = data
#   data.length.times do
#     post_data = single_run_bubble_sort(data)
#   end
#
#   post_data
# end