Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Mastering Algorithms With CISBN13:9781565924536ISBN10:1565924533Author:Loudon, Kyle (Author)Description:There Are Many Books On Data Structures And Algorithms, Including Some With Useful Libraries Of C Functions Mastering Algorithms With C Offers You A Unique Combination Of Theoretical Background And Working Code With Robust Solutions For Everyday Programming Tasks, This Book Avoids The Abstract Style Of Most Classic Data Structures And Algorithms Texts, But Still Provides All Of The Information You Need To Understand The Purpose And Use Of Common Programming Techniques Implementations, As Well As Interesting, Real-World Examples Of Each Data Structure And Algorithm, Are Included Using Both A Programming Style And A Writing Style That Are Exceptionally Clean, Kyle Loudon Shows You How To Use Such Essential Data Structures As Lists, Stacks, Queues, Sets, Trees, Heaps, Priority Queues, And Graphs He Explains How To Use Algorithms For Sorting, Searching, Numerical Analysis, Data Compression, Data Encryption, Common Graph Problems, And Computational Geometry And He Describes The Relative Efficiency Of All Implementations The Compression And Encryption Chapters Not Only Give You Working Code For Reasonably Efficient Solutions, They Offer Explanations Of Concepts In An Approachable Manner For People Who Never Have Had The Time Or Expertise To Study Them In Depth Anyone With A Basic Understanding Of The C Language Can Use This Book In Order To Provide Maintainable And Extendible Code, An Extra Level Of Abstraction (Such As Pointers To Functions) Is Used In Examples Where Appropriate Understanding That These Techniques May Be Unfamiliar To Some Programmers, Loudon Explains Them Clearly In The Introductory Chapters Contents Include: Pointersrecursionanalysis Of Algorithmsdata Structures (Lists, Stacks, Queues, Sets, Hash Tables, Trees, Heaps, Priority Queues, Graphs)Sorting And Searchingnumerical Methodsdata Compressiondata Encryptiongraph Algorithmsgeometric Algorithms For Anyone With A Basic Understanding Of C, The Robust Solutions Found Here Will Offer Help For Everyday Programming Tasks, Providing All The Necessary Information To Understand And Us Common Techniques Includes Implementations And Real-World Examples Of Each Data Structure In The Text, And Full-Source Code On The Accompanying Disk Binding:Paperback, PaperbackPublisher:OREILLY MEDIAPublication Date:1999-08-15Weight:2.09 lbsDimensions:1.17'' H x 9.99'' L x 6.99'' WNumber of Pages:560Language:English
Price: 42.91 USD
Location: USA
End Time: 2024-09-03T11:52:06.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Mastering Algorithms With C
Number of Pages: 560 Pages
Publication Name: Mastering Algorithms with C : Useful Techniques from Sorting to Encryption
Language: English
Publisher: O'reilly Media, Incorporated
Publication Year: 1999
Subject: Programming / General, General, Data Processing, Programming Languages / C
Item Height: 1.5 in
Type: Textbook
Item Weight: 33.4 Oz
Author: Kyle Loudon
Subject Area: Computers
Item Length: 9.1 in
Item Width: 7 in
Format: Trade Paperback
