cycle sort

cycle_sort.rb

blocks = (0..8).to_a.shuffle
puts blocks.inspect

i = 0
while i < 8
  until i == blocks[i]
    j = blocks[i]
    #swap blocks[i] with blocks[blocks[i]]
    blocks[i], blocks[j] = blocks[j], blocks[i]
  end
  i += 1
end

puts blocks.inspect

cycle sort implemented in ruby

more info here: https://en.wikipedia.org/wiki/Cycle_sort

I ended up using similar code to write a naive defragmenter for a school project because of the minimal number of writes