Sorting by distributive partitioning

DOI10.1016/0020-0190(78)90028-5zbMath0373.68034MaRDI QIDQ1244813

Wlodzimierz Dobosiewicz

Publication date: 1978

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(78)90028-5

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W99: Algorithms in computer science

Related Items

Sorting numbers using limited systolic coprocessors, A space efficient distributive sort, The multilevel principle applied to sorting, Sorting in linear expected time, A randomized parallel branch-and-bound algorithm, Selection by distributive partitioning, Average time behavior of distributive sorting algorithms, The design and analysis of a new hybrid sorting algorithm, Usort: An efficient hybrid of distributive partitioning sorting, Sorting numbers in linear expected time and optimal extra space, Bibliography on the evaluation of numerical software, Complexity of sorting by distributive partitioning, An efficient external sorting algorithm, Analysis of N-trees, Linear sorting with O(log n) processors, The asymptotic behaviour of a distributive sorting method, Some results on tries with adaptive branching., Parallel distributive partitioned sorting methods

Uses Software

• Quicksort

Cites Work

• The analysis of Quicksort programs
• Finding the median
• Time bounds for selection
• Unnamed Item
• Unnamed Item
• Unnamed Item