English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In a recent number of this Journal, Fike (1975) has given a new algorithm for generating permutations, which his experiments indicate is comparable with the fastest known methods (see Ord-Smith, 1970 and 1971). In this paper we consider some programming modifications to the procedures Fike presents which improve the performance by a factor of about 2. The timings show that with a compiler which handles procedure calls reasonably, a recursive procedure is the most efficient.

Programming Improvements to Fike's Algorithm for Generating Permutations