A fully vectorized quicksort

DOI10.1016/0167-8191(90)90074-JMaRDI QIDQ922695zbMATH OpenFDO

Authors Stewart A. Levin

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90074-J

zbMATH Keywords

partitionQuicksortSortingodd-even transposition

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• Timing results of some internal sorting algorithms on vector computers
• Sorting on STAR
• scientific article; zbMATH DE number 4106258
• Timing results of some internal sorting algorithms on the ETA 10-P
• Analysis of the performance of the parallel quicksort method

Cited in

(5)

• Sorting on STAR
• Timing results of some internal sorting algorithms on vector computers
• scientific article; zbMATH DE number 4106258 (Why is no real title available?)
• A generalized, one-way, stackless quicksort
• Timing results of some internal sorting algorithms on the ETA 10-P

This page was built for publication: A fully vectorized quicksort

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922695)