all tasks

Task/Sorting-algorithms-Insertion-sort/Ruby/sorting-algorithms-insertion-sort-1.rb

@@ -0,0 +1,17 @@
+class Array
+  def insertionsort!
+    1.upto(length - 1) do |i|
+      value = self[i]
+      j = i - 1
+      while j >= 0 and self[j] > value
+        self[j+1] = self[j]
+        j -= 1
+      end
+      self[j+1] = value
+    end
+    self
+  end
+end
+ary = [7,6,5,9,8,4,3,1,2,0]
+ary.insertionsort!
+# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

Task/Sorting-algorithms-Insertion-sort/Ruby/sorting-algorithms-insertion-sort-2.rb

@@ -0,0 +1,17 @@
+class Array
+  def insertionsort!
+    return if length < 2
+
+    1.upto(length - 1) do |i|
+      value = delete_at i
+      j = i - 1
+      j -= 1 while j >= 0 && value < self[j]
+      insert(j + 1, value)
+    end
+    self
+  end
+end
+
+ary = [7,6,5,9,8,4,3,1,2,0]
+ary.insertionsort!
+# => [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]