Merge pull request #22 from Ramy-Badr-Ahmed/tests_examples/sorts/recursive_bubble_sort

Modified `modules/sorts/recursive_bubble_sort.f90`

Author: SatinWukerORIG

examples/sorts/example_recursive_bubble_sort.f90

@@ -0,0 +1,21 @@
+!> Example Program for Recursive Bubble Sort
+!!
+!! This program demonstrates the use of the `recursive_bubble_sort_module` to sort an array using the recursive bubble sort algorithm.
+
+program recursive_bubble_sort_example
+    use recursive_bubble_sort_module
+    implicit none
+
+    real :: array(5)
+
+    !! Fill the array with random numbers.
+    call random_number(array)
+
+    print*, "Before:", array
+
+    !! Bubble sort subroutine call.
+    call recursive_bubble_sort(array, size(array))
+
+    print*, "After:", array
+
+end program recursive_bubble_sort_example

modules/sorts/recursive_bubble_sort.f90

@@ -1,51 +1,35 @@
-!> Recursive Bubble Sort
+!> Recursive Bubble Sort Module
 !!
-!! This is a simple example for recursive bubble sort algorithm in Fortran.
-
-program recursive_bubble_sort_program
-implicit none
-
-    real :: array(5)
-
-    !! random_number subroutine fills the argument with random numbers.
-    call random_number(array)
-
-    print*, "Before:", array
-
-    !! Bubble sort subroutine call.
-    call recursive_bubble_sort(array, size(array))
-
-    print*, "After:", array
+!! This module contains a subroutine for sorting a collection using the recursive bubble sort algorithm.
 
+module recursive_bubble_sort_module
+    implicit none
 contains
 
     !! This subroutine sorts the collection recursively using bubble sort.
     !! Recursive keyword at the start declares that the function is recursive.
-    recursive subroutine recursive_bubble_sort(collection, collection_size) 
-        real, dimension(:), intent(inout) :: collection !! A collection for elements of type real
+    recursive subroutine recursive_bubble_sort(collection, collection_size)
+        real, dimension(:), intent(inout) :: collection !! A collection for elements of type real.
         integer, intent(in) :: collection_size          !! Collection's size.
 
         integer :: i
         real :: temp
 
-        do i = 1, collection_size
-            if (collection(i) .gt. collection(i+1)) then
-                !! If collection is out of order in [i, i+1] region,
-                !! swap these values using a temp variable as follows.
-
+        !! Perform bubble sort on the collection.
+        do i = 1, collection_size - 1
+            if (collection(i) .gt. collection(i + 1)) then
+                !! Swap values if they are out of order in [i, i + 1] region.
                 temp = collection(i)
-                collection(i) = collection(i+1)
-                collection(i+1) = temp
+                collection(i) = collection(i + 1)
+                collection(i + 1) = temp
             end if
         end do
 
+        !! Recursively call the subroutine with (collection_size - 1) if size > 2.
         if (collection_size .gt. 2) then
-            !! If collection's size is greater then 2, 
-            !! this subroutine recursively calls itself with (collection_size - 1) for size argument.
             call recursive_bubble_sort(collection, collection_size - 1)
         end if
 
     end subroutine recursive_bubble_sort
 
-end program recursive_bubble_sort_program
-
+end module recursive_bubble_sort_module