Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching

Algorithms in C, Parts 1-4

Fundamentals, Data Structures, Sorting, Searching

1997 • 730 pages

Ratings1

Average rating3

15

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.

Tags


Become a Librarian

Reviews

Popular Reviews

Reviews with the most likes.

There are no reviews for this book. Add yours and it'll show up right here!