Computer algorithms: introduction to design and analysis

By: Baase, Sara
Material type: TextTextSeries: Addison-Wesley series in computer sciencePublisher: Reading, Massachusetts Addison-Wesley Publishing Company 1978Description: xvii, 286 p.ISBN: 0201003279Subject(s): Computer programming | Computer algorithmsDDC classification: 519.4 Summary: Extensively revised this best seller on algorithm design and analysis to make it the most current and accessible book available. This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. Highlights *Emphasizes the development of algorithms through a step-by-step process rather than merely presenting the end result * Stresses the importance of the algorithm analysis process-continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained * Provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique * Uses a Java-like pseudocode; includes an appendix with Java examples 0201612445B04062001
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Item location Collection Call number Status Date due Barcode
Books Vikram Sarabhai Library
Slot 1409 (0 Floor, East Wing) Non-fiction 519.4 B2C6 (Browse shelf) Available 186166

Includes index.

Bibliography: p. 277-280.

Extensively revised this best seller on algorithm design and analysis to make it the most current and accessible book available. This edition features an increased emphasis on algorithm design techniques such as divide-and-conquer and greedy algorithms, along with the addition of new topics and exercises. It continues the tradition of solid mathematical analysis and clear writing style that made it so popular in previous editions. Highlights *Emphasizes the development of algorithms through a step-by-step process rather than merely presenting the end result * Stresses the importance of the algorithm analysis process-continuously re-evaluating, modifying, and perhaps rejecting algorithms until a satisfactory solution is attained * Provides extensive treatment of recursion with a clear, student-friendly review of how it works and why it is a valuable programming technique * Uses a Java-like pseudocode; includes an appendix with Java examples 0201612445B04062001

There are no comments for this item.

to post a comment.

Powered by Koha