Adding elementary sorting algorithms

algorithms/sorting/bubblesort.m

@@ -0,0 +1,14 @@
+bubblesort(list) :=
+  block(
+    [len: length(list)],
+    for i:1 thru len do (
+      for j:1 thru (len - 1) do (
+        if (list[j] > list[j + 1]) then (
+            temp:list[j],
+            list[j]:list[j + 1],
+            list[j + 1]:temp
+        )
+      )
+    ),
+    list
+  );

algorithms/sorting/insertionsort.m

@@ -0,0 +1,14 @@
+insertionnsort(list) :=
+  block(
+    [len: length(list)],
+    for i:2 thru len do (
+      key:list[i],
+      j:(i - 1),
+      while j >= 1 and list[j] > key do (
+        list[j + 1]:list[j],
+        j:(j - 1)
+      ),
+      list[j + 1]:key
+    ),
+    list
+  );

algorithms/sorting/selectionsort.m

@@ -0,0 +1,14 @@
+selectionnsort(list) :=
+  block(
+    [len: length(list)],
+    for i:1 thru len do (
+      min:i,
+      for j:(i + 1) thru len do (
+        if (list[j] < list[min]) then min:j
+      ),
+      temp:list[min],
+      list[min]:list[i],
+      list[i]:temp
+    ),
+    list
+  );

readme.md

@@ -334,7 +334,7 @@ just a paper and pencil.
 
 - [Bead Sort](sorting/)
 - [Bogo Sort](sorting/)
-- [Bubble Sort](sorting/)
+- [Bubble Sort](algorithms/sorting/bubblesort.m)
 - [Bucket Sort](sorting/)
 - [Circle Sort](sorting/)
 - [Comb Sort](sorting/)
@@ -343,14 +343,14 @@ just a paper and pencil.
 - [Flash Sort](sorting/)
 - [Gnome Sort](sorting/)
 - [Heap Sort](sorting/)
-- [Insertion Sort](sorting/)
+- [Insertion Sort](algorithms/sorting/insertionsort.m)
 - [Intro Sort](sorting/)
 - [Median Sort](sorting/)
-- [Merge Sort](sorting/)
+- [Merge Sort](algorithms/sorting/mergesort.m)
 - [Pipeonhole Sort](sorting/)
 - [Quick Sort](sorting/)
 - [Radix Sort](sorting/)
-- [Selection Sort](sorting/)
+- [Selection Sort](algorithms/sorting/selectionsort.m)
 - [Shaker Sort](sorting/)
 - [Shell Sort](sorting/)
 - [Sleep Sort](sorting/)