Smoothsort, an alternative for sorting in situ

DOI10.1016/0167-6423(82)90016-8zbMath0486.68050OpenAlexW2075646121MaRDI QIDQ1165006

No author found.

Publication date: 1982

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(82)90016-8

zbMATH Keywords

smoothnesssmooth transitionsorting algorithmnearly sorted sequencespresentation of programspure exchange sort

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (12)

A framework for adaptive sorting ⋮ Exploiting few inversions when sorting: Sequential and parallel algorithms ⋮ Space-efficient planar convex hull algorithms ⋮ Computing and ranking measures of presortedness ⋮ Generalized Fibonacci–Leonardo numbers ⋮ An introduction to three algorithms for sorting in situ ⋮ An optimal parallel adaptive sorting algorithm ⋮ A note on adaptive parallel sorting ⋮ Opportunistic algorithms for eliminating supersets ⋮ Smoothsort's behavior on presorted sequences ⋮ Context-free languages can be accepted with absolutely no space overhead ⋮ On partitions and presortedness of sequences

This page was built for publication: Smoothsort, an alternative for sorting in situ