4. Sorting, Sets and Selection

A. Andersson: “Implementing Radixsort”

J. Bentley: “Programming Pearls: Selection”

J. Bentley and R. Sedgewick: “Fast Algorithms for Sorting and Searching Strings”

A. Bergeron: “A Very Elementary Presentation of the Hannenhalli-Pevzner Theory”

B. C. Huang and M. A. Langston: “Practical In-Place Merging”

S. M. Merritt and C. Y. Nauck: “Inventing a New Sorting Algorithm: A Case Study”




Tilbage til hovedsiden


Januar 2003 Keld Helsgaun