Upload New File

Uebung/SoSe2023/ListSort.f95

+program QueueProgram
+
+    implicit none
+    integer, dimension(10)  ::myList
+
+    myList = (/4,2,8,5,1,9,7,6,3,0/)
+
+    write(*,*)myList
+    call bubbleSort(myList)
+    write(*,*)myList
+
+    contains
+
+        subroutine swap(a,b)
+            integer, intent(inout)  :: a,b
+            integer                 :: sw
+            sw = a
+            a = b
+            b = sw
+        end subroutine swap
+
+
+    	subroutine bubbleSort(list)
+            integer, dimension(:), intent(inout)    :: list
+            integer                                 :: i, n
+
+            do n=size(list), 1, -1
+                do i=1, n-1
+                    if(list(i) > list(i+1)) then
+                        call swap(list(i), list(i+1))
+                    end if
+                end do
+            end do
+        end subroutine bubbleSort
+
+        subroutine selectionSort(list)
+
+        end subroutine selectionSort
+end program QueueProgram