class Array { method insertion_sort { { |i| var j = i-1 var k = self[i] while ((j >= 0) && (k < self[j])) { self[j+1] = self[j] j-- } self[j+1] = k } << 1..self.end return self } } var a = 10.of { 100.irand } say a.insertion_sort
Last updated 1 year ago
Was this helpful?