
>> | LShop | >> | Book | >> | Computing & Informat... | >> | Computer Science | >> | Algorithms In C: Fun... |
ISBN
:
9788131712917
Publisher
:
Pearson
Subject
:
Computer Science
Binding
:
Paperback
Pages
:
720
Year
:
1998
₹
879.0
₹
650.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View DetailsEstimated Shipping Time : 5-7 Business Days
View DetailsDescription
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. Sorting 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
Are you sure you want to remove the item from your Bag?
Yes
No
Added to Your Wish List
OK
Your Shopping Bag
- 3 Items
Item
Delivery
Unit Price
Quantity
Sub Total
Order Summary
Download App