Rosetta Code

Sorting Algorithms/Circle Sort: Difference between revisions

Page Discussion

Sorting Algorithms/Circle Sort (view source)

Revision as of 01:53, 17 April 2018

136 bytes removed ,  6 years ago
→‎{{header|Fortran}}
Line 334:
! This is the canonical algorithm. However, if you want to
! speed it up, count the iterations and when you have approached
! log0.5*ln(n) iterations, perform a binary insertion sort then exit the loop.
! For smaller sized arrays ~ 2million elements, 0.5*log(n) iterations works better, for larger
! arrays, take the former suggested number.
end do
end subroutine circle_sort
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/253815"