Your cart is empty.
  • Home

    Beginning algorithms / Simon Harris and James Ross.

    By: Harris, Simon, 1972-Contributor(s): Ross, James, 1968-Material type: TextTextSeries: Wrox beginning guides: Publisher: Indianapolis, IN : Wiley, 2006Description: xxvi, 564 p. : ill. ; 24 cmISBN: 9780764596742 (paper/website); 0764596748 (paper/website)Subject(s): Computer algorithmsDDC classification: 005.1 LOC classification: QA76.9.A43 | H37 2006Online resources: Table of contents only | Publisher description | Contributor biographical information
    Contents:
    Getting started -- Iteration and recursion -- String searching -- Lists -- Queues -- Stacks -- Basic sorting -- Advance sorting -- Priority queues -- Binary searching -- Binary search trees -- Red-black trees -- Hashing -- Sets -- Maps -- Computational geometry -- Digital search trees -- B-trees -- Pragmatic optimisation.
    Review: "Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development."--BOOK JACKET.
    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 library Call number Copy number Status Notes Date due Barcode
    Books Books Female Library
    		QA76.9 .A43 H37 2006 (Browse shelf (Opens below)) 1 Available STACKS 51952000097716
    Books Books Main Library
    		QA76.9 .A43 H37 2006 (Browse shelf (Opens below)) 1 Available STACKS 51952000124597

    "Programmer to programmer"--Cover.

    Includes bibliographical references and index.

    Getting started -- Iteration and recursion -- String searching -- Lists -- Queues -- Stacks -- Basic sorting -- Advance sorting -- Priority queues -- Binary searching -- Binary search trees -- Red-black trees -- Hashing -- Sets -- Maps -- Computational geometry -- Digital search trees -- B-trees -- Pragmatic optimisation.

    "Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development."--BOOK JACKET.

    1 2

    There are no comments on this title.

    to post a comment.