Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
imported>MM (→{{header|Python}}: use speaking variable names.) |
m (→{{header|Fortran}}: added syntax highlighting) |
||
Line 4,676: | Line 4,676: | ||
=={{header|Fortran}}== |
=={{header|Fortran}}== |
||
{{Works with|Fortran|90 and later}} |
{{Works with|Fortran|90 and later}} |
||
<syntaxhighlight lang="fortran"> |
|||
recursive subroutine fsort(a) |
recursive subroutine fsort(a) |
||
use inserts, only:insertion_sort !Not included in this posting |
use inserts, only:insertion_sort !Not included in this posting |
||
Line 4,733: | Line 4,734: | ||
return |
return |
||
end subroutine fsort |
end subroutine fsort |
||
</syntaxhighlight> |
|||
</pre> |
|||
=={{header|FreeBASIC}}== |
=={{header|FreeBASIC}}== |