Initial data commit

Task/Sorting-algorithms-Insertion-sort/R/sorting-algorithms-insertion-sort-1.r

@@ -0,0 +1,16 @@
+insertionsort <- function(x)
+{
+   for(i in 2:(length(x)))
+   {
+      value <- x[i]
+      j <- i - 1
+      while(j >= 1 && x[j] > value)
+      {
+         x[j+1] <- x[j]
+         j <- j-1
+      }
+      x[j+1] <- value
+   }
+   x
+}
+insertionsort(c(4, 65, 2, -31, 0, 99, 83, 782, 1)) # -31   0   1   2   4  65  83  99 782

Task/Sorting-algorithms-Insertion-sort/R/sorting-algorithms-insertion-sort-2.r

@@ -0,0 +1,17 @@
+insertion_sort <- function(x) {
+  for (j in 2:length(x)) {
+    key <- x[j]
+    bp <- which.max(x[1:j] > key)
+    # 'bp' stands for breakpoint
+    if (bp == 1) {
+      if (key < ar[1]){
+          x <- c(key, ar[-j])
+      }
+    }
+    else {
+      x <- x[-j]
+      x <- c(ar[1:bp - 1], key, x[bp : (s-1)])
+    }
+  return(x)
+  }
+}