Please use this identifier to cite or link to this item: doi:10.22028/D291-26086
Title: Sorting presorted files
Author(s): Mehlhorn, Kurt
Language: English
Year of Publication: 1978
OPUS Source: Saarbrücken, 1978
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: A new sorting algorithm is presented. Its running time is O(n(1+10g(F/n)) where F = I{(f,j); i < j and xi < xj}1 is the total number of inversions in the input sequence xn xn_1 xn_2 ... x2 xl• In other words, presorted sequences are sorted quickly, and completely unsorted sequences are sorted in O(n log n) steps. Note that F < n2/2 always. Furthermore, the constant of proportionality is fairly small and hence the sorting method is competitive with existing methods for not too large n.
Link to this record: urn:nbn:de:bsz:291-scidok-40428
Series name: Bericht / A / Fachbereich Angewandte Mathematik und Informatik, Universität des Saarlandes
Series volume: 1978/12
Date of registration: 29-Jul-2011
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
fb14_1978_12.pdf2,56 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.