![]() |
Volumn 2003-January, Issue , 2003, Pages 242-250
|
An in-place sorting with O(n log n) comparisons and O(n) moves
|
Author keywords
Computer science; Contracts; History; Internet; Layout; Merging; Sorting; Upper bound
|
Indexed keywords
COMPUTER SCIENCE;
COMPUTERS;
CONTRACTS;
HISTORY;
INTERNET;
MERGING;
SORTING;
COMPUTATIONAL RESOURCES;
ELEMENT COMPARISON;
IN-PLACE ALGORITHMS;
LAYOUT;
LOWER BOUNDS;
SORTING ALGORITHM;
UPPER BOUND;
ALGORITHMS;
|
EID: 1842602935
PISSN: 02725428
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/SFCS.2003.1238198 Document Type: Conference Paper |
Times cited : (3)
|
References (15)
|