Ternary Search Trees Jon Bentley and Robert Sedgewick feature article in Dr. Dobbs Journal April, 1998 Abstract When you have to store a set of strings, what data structure do you use Jon and Bob suggest one place you can start is with ternary search trees, which combine the time efficiency of digital tries with the space efficiency of binary search trees. online version of article at Dr. Dobbs ...

Description, source code, algorithm analysis, and empirical results for bubble, heap, insertion, merge, quick, selection, and shell sorts.

Discussion of Sorting Algorithms Copyright by Mark Baker 1996, 1999 Copyright waiver Return to MarkChrisSoft home page Firstly the operation of the different algorithms is examined, then their relative performance is discussed. Introduction I grew up with the bubble sort, in common, I am sure, with many colleagues. Having learnt one sorting algorithm, there seemed little point in learning any ...