Ruby 冒泡排序

arr = [2,5,1,8,7]

def getSort(arr)
  len = arr.length
  for i in 0...len-1
    for j in 0...len-i-1
      if arr[j] > arr[j+1]        
        temp = arr[j]
        arr[j] = arr[j+1]
        arr[j+1] = temp
      end
    end
  end
end
getSort(arr)
p arr