Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 191: / Line 191: @@
 =={{header|BBC BASIC}}==
+Note that the array index is assumed to start at zero.
-<lang BBCBASIC>DEF PROC_InsertionSort(Size%)
+<lang bbcbasic>      DIM test(9)
-FOR I%=2 TO Size%
+      test() = 4, 65, 2, -31, 0, 99, 2, 83, 782, 1
-   Temp%=data%(I%)
+      PROCinsertionsort(test(), 10)
-   J%=I%
+      FOR i% = 0 TO 9
-   WHILE J%>1 AND Temp%<data%(J%-1)
-      data%(J%)=data%(J%-1)
+        PRINT test(i%) ;
-      J%=J%-1
+      NEXT
-   ENDWHILE
+      PRINT
+      END
-   IF J% <> I% data%(J%)=Temp%
-NEXT I%
+      DEF PROCinsertionsort(a(), n%)
-ENDPROC</lang>
+      LOCAL i%, j%, t
+      FOR i% = 1 TO n%-1
+        t = a(i%)
+        j% = i%
+        WHILE j%>0 AND t<a(ABS(j%-1))
+          a(j%) = a(j%-1)
+          j% -= 1
+        ENDWHILE
+        a(j%) = t
+      NEXT
+      ENDPROC</lang>
+'''Output:'''
+<pre>
+       -31         0         1         2         2         4        65        83        99       782
+</pre>
 =={{header|C}}==