এলগরিদমস ইন সি ফান্ডামেন্টালস ডাটা স্ট্রাকচার্স, শর্টিং, সার্চিং, পার্টস ১-৪ (Paperback)

This book provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. The algorithms and data structures are expressed in concise implementations in C, so that the reader can both appreciate their fundamental properties and test them on real applications.

features
* Expanded coverage of arrays, linked lists, strings, trees and other basic data structures
* Greater emphasis on abstract data types (ADTs) than in previous editions
* Over 100 algorithms of sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations
* New implementations of binomial queues, multiway radix sorting, Bathcer’s sorting networks, randomized BSTs, spaly trees, skip lists, multiway tries, and much more
* Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies
* Over 1000 new exercises to help you learn the properties of algorithms

Table Of Contents
I. Fundamentals
* Introduction.
* Principles of Algorithm Analysis.

II. Data Structures
* Elementary Data Structures
* Abstract Data Types
* Recursion and Trees

III. SortingM
* Elementary Sorting Methods
* Quicksort
* Mergesort
* Priority Queues and Heaspsort
* Radix Sorting
* Special-Purpose Sorts

IV. Searching
* Symbol Tables and STs
* Balanced Trees
* Hashing Radix Search
* External Searching