aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Sync

Browse source
This commit is contained in:
Ingy döt Net 2013-10-27 22:24:23 +00:00
parent 6f050a029e
commit 776bba907c
3887 changed files with 59894 additions and 7280 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Task/Sorting-algorithms-Quicksort/Fortran/sorting-algorithms-quicksort.f
View file

@ -25,7 +25,7 @@ integer :: marker
if (nA > 1) then
call random_number(random)
pivot = A(int(random*real(nA-1))+1)%value ! random pivot (not best performance, but avoids worst-case)
pivot = A(int(random*real(nA-1))+1)%value ! random pivor (not best performance, but avoids worst-case)
left = 0
right = nA + 1
@ -67,7 +67,7 @@ implicit none
integer, parameter :: l = 8
type (group), dimension(l) :: A
integer, dimension(3) :: seed = [1, 2, 3]
integer, dimension(12) :: seed = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
integer :: i
real :: random