all tasks

Task/Sorting-algorithms-Insertion-sort/Fortran/sorting-algorithms-insertion-sort-1.f

@@ -0,0 +1,15 @@
+PURE SUBROUTINE Insertion_Sort(a)
+  REAL, INTENT(in out), DIMENSION(:) :: a
+  REAL :: temp
+  INTEGER :: i, j
+
+  DO i = 2, SIZE(a)
+     j = i - 1
+     temp = a(i)
+     DO WHILE (j>=1 .AND. a(j)>temp)
+        a(j+1) = a(j)
+        j = j - 1
+     END DO
+     a(j+1) = temp
+  END DO
+END SUBROUTINE Insertion_Sort

Task/Sorting-algorithms-Insertion-sort/Fortran/sorting-algorithms-insertion-sort-2.f

@@ -0,0 +1,7 @@
+DO i = 2, SIZE(a)
+   j = i - 1
+   DO WHILE (j>=1 .AND. a(j) > a(i))
+      j = j - 1
+   END DO
+   a(j+1:i) = cshift(a(j+1:i),-1)
+END DO

Task/Sorting-algorithms-Insertion-sort/Fortran/sorting-algorithms-insertion-sort-3.f

@@ -0,0 +1,14 @@
+      SUBROUTINE SORT(N,A)
+      IMPLICIT NONE
+      INTEGER N,I,J
+      DOUBLE PRECISION A(N),X
+      DO 30 I=2,N
+      X=A(I)
+      J=I
+   10 J=J-1
+      IF(J.EQ.0 .OR. A(J).LE.X) GO TO 20
+      A(J+1)=A(J)
+      GO TO 10
+   20 A(J+1)=X
+   30 CONTINUE
+      END