Bubblesort Fortran 90 (#390)

* Delete monte_carlo_pi.f90

* init

* further implementation

* next

* finished implementation and docs

* Line spacing added

* Fixed an error in the .md

Author: depate

contents/bubble_sort/bubble_sort.md

@@ -48,6 +48,8 @@ This means that we need to go through the vector $$\mathcal{O}(n^2)$$ times with
 [import:3-28, lang:"lisp"](code/lisp/bubble_sort.lisp)
 {% sample lang="nim" %}
 [import:5-9, lang:"nim"](code/nim/bubble_sort.nim)
+{% sample lang="f90" %}
+[import:19-40, lang:"fortran"](code/fortran/bubble.f90)
 {% endmethod %}
 
 ... And that's it for the simplest bubble sort method.
@@ -101,6 +103,8 @@ Trust me, there are plenty of more complicated algorithms that do precisely the
 [import, lang:"lisp"](code/lisp/bubble_sort.lisp)
 {% sample lang="nim" %}
 [import, lang:"nim"](code/nim/bubble_sort.nim)
+{% sample lang="f90" %}
+[import, lang:"fortran"](code/fortran/bubble.f90)
 {% endmethod %}
 
 <script>

contents/bubble_sort/code/fortran/bubble.f90

@@ -0,0 +1,42 @@
+PROGRAM main
+
+    IMPLICIT NONE
+    REAL(8), DIMENSION(10) :: A
+
+    A = (/ 1d0, 3d0, 2d0, 4d0, 5d0, 10d0, 50d0, 7d0, 1.5d0, 0.3d0 /)
+
+    WRITE(*,*) 'Input vector'
+    WRITE(*,'( F6.2 )') A
+    WRITE(*,*) ' '
+
+    CALL bubblesort(A)
+
+    WRITE(*,*) 'Output vector'
+    WRITE(*,'(F6.2)') A
+
+CONTAINS
+
+SUBROUTINE bubblesort(array)
+
+    IMPLICIT NONE
+    INTEGER                              :: array_length, i, j, n
+    REAL(8)                              :: tmp
+    REAL(8), DIMENSION(:), INTENT(INOUT) :: array
+
+    array_length = size(array)
+    n = array_length
+    
+    DO i=1, n
+        DO j=1, n-1
+            IF ( array(j) > array(j+1) ) THEN
+
+                tmp        = array(j+1)
+                array(j+1) = array(j)
+                array(j)   = tmp
+                                
+            END IF
+        END DO
+    END DO
+END SUBROUTINE bubblesort
+    
+END PROGRAM main