290714_warmup.rb

#Chad Brading && Jessica Goulding
#merge a, b, c to return an array of all numbers
#then sort [1,2,3,4,5,6,7,8,9].

a = [1,4,9]  # => [1, 4, 9]
b = [2,3,5]  # => [2, 3, 5]
c = [6,7,8]  # => [6, 7, 8]

#Option Number 1
(a+b+c).sort  # => [1, 2, 3, 4, 5, 6, 7, 8, 9]

#Option Number 2
abc = a + b + c  # => [1, 4, 9, 2, 3, 5, 6, 7, 8]
abc.sort         # => [1, 2, 3, 4, 5, 6, 7, 8, 9]

#Option Number 3
numbers = a.concat b.concat c  # => [1, 4, 9, 2, 3, 5, 6, 7, 8]
numbers.sort                   # => [1, 2, 3, 4, 5, 6, 7, 8, 9]

#Option Number 4: Write your own sorting method
  a = [1,4,9]                # => [1, 4, 9]
  b = [2,3,5]                # => [2, 3, 5]
  c = [6,7,8]                # => [6, 7, 8]

  d = a+b+c                  # => [1, 4, 9, 2, 3, 5, 6, 7, 8]
  d.each do |n|              # => [1, 4, 9, 2, 3, 5, 6, 7, 8]
    (d.size-1).times do |k|  # => 8, 8, 8, 8, 8, 8, 8, 8, 8
      if d[k] > d[k+1]       # => false, false, true, true, true, true, true, true, false, true, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, fals...
        m = d[k+1]           # => 2, 3, 5, 6, 7, 8, 2, 3
        d[k+1] = d[k]        # => 9, 9, 9, 9, 9, 9, 4, 4
        d[k] = m             # => 2, 3, 5, 6, 7, 8, 2, 3
      end                    # => nil, nil, 2, 3, 5, 6, 7, 8, nil, 2, 3, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil, nil...
    end                      # => 8, 8, 8, 8, 8, 8, 8, 8, 8
  end                        # => [1, 2, 3, 4, 5, 6, 7, 8, 9]