Avoiding having to calculate the gcd when doing cycle decomposition -- Raymond Chen

T1Covered by 1 source · first reported by Language blogs: Rust / Go / TypeScript / Swift / Kotlin / Java / .NET / Ruby / PHP / Elixir / ISO C++ at 03 Aug, 20:42 UTC

Last time, we looked at how clang’s libcxx implementation of std::rotate uses cycle decomposition to minimize the number of swaps. Doing so requires calculating the greatest common divisor, but I noted that the OpenJDK implementation of the java standard library uses a trick to avoid doing the gcd…

dev

Sources

• T1Avoiding having to calculate the gcd when doing cycle decomposition -- Raymond ChenLanguage blogs: Rust / Go / TypeScript / Swift / Kotlin / Java / .NET / Ruby / PHP / Elixir / ISO C++03 Aug, 20:42