Algorithms in C, Parts 1-4
About this book
Introduction. Principles of algorithm analysis. Elementary data structures. Abstract data types. Recursion and trees. Elementary sorting methods. Quicksort. Merging and mergesort. Priority queues and heapsort. Radix sorting. Special-purpose sorts. Symbol tables and BSTs. Balanced trees. Hashing. Radix search. External searching. Index.
Details
- First published
- 1997
- OL Work ID
- OL1907093W
Subjects
Computer algorithmsC (Computer program language)