all tasks

Task/Sorting-algorithms-Insertion-sort/SNOBOL4/sorting-algorithms-insertion-sort.sno

@@ -0,0 +1,20 @@
+* read data into an array
+	A = table()
+	i = 0
+readln	A<i = i + 1> = trim(input)	:s(readln)
+	aSize = i - 1
+
+* sort array
+	i = 1
+loop1	value = A<i>
+	j = i - 1
+loop2	gt(j,0) gt(A<j>,value)	:f(done2)
+	A<j + 1> = A<j>
+	j = j - 1	:(loop2)
+done2	A<j + 1> = value	
+	i = ?lt(i,aSize) i + 1	:s(loop1)
+	i = 1
+
+* output sorted data
+while	output = A<i>; i = ?lt(i,aSize) i + 1	:s(while)
+end