Bubble sort program in Ruby

Bubble sort program in Ruby

Step-by-step example

Let us take the array of numbers "5 1 4 2 8", and sort the array from lowest number to greatest number using bubble sort. In each step, elements written in bold are being compared. Three passes will be required.

First Pass:
( 5 1 4 2 8 )  ( 1 5 4 2 8 ), Here, algorithm compares the first two elements, and swaps since 5 > 1.
( 1 5 4 2 8 )  ( 1 4 5 2 8 ), Swap since 5 > 4
( 1 4 5 2 8 )  ( 1 4 2 5 8 ), Swap since 5 > 2
( 1 4 2 5 8 )  ( 1 4 2 5 8 ), Now, since these elements are already in order (8 > 5), algorithm does not swap them.
Second Pass:
( 1 4 2 5 8 )  ( 1 4 2 5 8 )
( 1 4 2 5 8 )  ( 1 2 4 5 8 ), Swap since 4 > 2
( 1 2 4 5 8 )  ( 1 2 4 5 8 )
( 1 2 4 5 8 )  ( 1 2 4 5 8 )
Now, the array is already sorted, but the algorithm does not know if it is completed. The algorithm needs one whole pass without any swap to know it is sorted.
Third Pass:
( 1 2 4 5 8 )  ( 1 2 4 5 8 )
( 1 2 4 5 8 )  ( 1 2 4 5 8 )
( 1 2 4 5 8 )  ( 1 2 4 5 8 )
( 1 2 4 5 8 )  ( 1 2 4 5 8 )

Bubble sort program in Ruby

 class Bubble
  def order
  puts "Enter the size of the array"
a = gets.to_i
puts "Enter #{a} elements"
b = Array.new
for i in 0..a-1
  b[i] = gets.to_i
end
k = b.size 
for j in 0..k
  for i in 0..k
  if b[i+1] == nil 
    break
  end
    if b[i] > b[i+1]
      temp = b[i+1]
      b[i+1] = b[i]
      b[i] = temp
      puts "The Bubble sorted list is  #{b}"
    end
  end
end
end
end
obj = Bubble.new
obj.order