Insertion sort implementation

gistfile1.rb

def insertion_sort(array)
  i = 0
  while i < array.length
    j = 0
    while array[j] < array[i]
      j += 1
    end
    
    # array[j] is the first element >= array[i]
    # delete array[i] and move it to just before position j
    val = array.delete_at(i)
    array.insert(j, val)
    
    i += 1
  end
end

I think one could start incrementing i from 1 instead of 0 since that first array element is never moved. Line 2 would read i = 1. Is that correct?