An improvement on tree selection sort

DOI10.1007/3-540-45643-0_15MaRDI QIDQ4707800zbMATH OpenFDO

Authors Jing-Chao Chen

Publication date 11 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2409/24090194.htm

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1268192
• A refinement of replacement selection
• Sorting with minimum data movement
• Sorting with minimum data movement
• In-place sorting

Cited in

(6)

• Efficient selection on a binary tree
• A tree-based mergesort
• A refinement of replacement selection
• scientific article; zbMATH DE number 1268192 (Why is no real title available?)
• Study on the fast stable list-selection sorting algorithm
• An improvement of the tree code construction

This page was built for publication: An improvement on tree selection sort

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