My Ruby implementation of the Quick-Find/ Union algorithm

quick_find_union.rb

class QuickFindUnion

  def initialize(n)
    @id = Array.new(n) {|i| i}
  end

  def connected?(p, q)
    puts @id[p] == @id[q]
  end

  def union(p, q)
    @p_id = @id[p]
    @q_id = @id[q]
    i = 0

    while i < @id.length do
      if @id[i] == @p_id
        @id[i] = @q_id
      end
      i += 1
    end
  end
end