Algorithms in C++, Parts 1-4

Kort om boken

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ imp…

Oppdag mer

Velg tagger...
Spar {0}
Spar {0} som ARK-VENN
{0} til nettpris
med Klikk&Hent
Format/språk
Format
Forklaring av formater
  • Innbundet

    Bok med hardt omslag.

  • Pocket

    Heftet bok med mykt omslag.

  • Kartonert

    Bok med tykke, stive sider.

  • E-Bok

    Digitalt format. E-bok kan leses i ARK-appen eller på Kindle. Bøkene kan også lastes ned fra Din side.

  • Nedlastbar lydbok

    Digitalt format. Nedlastbar lydbok kan lyttes til i ARK-appen. Bøkene kan også lastes ned fra Din side.

  • Digikort lydbok

    Lydbok på digikort. Krever Digispiller.

  • Compact Disc

    Lydbok eller musikk på CD. Krever CD-spiller eller annen kompatibel avspiller.

  • Vinyl

    Vinylplate. Krever platespiller.

  • DVD

    DVD-film. Krever DVD-spiller eller annen kompatibel avspiller.

  • Blu-ray

    Blu-ray-film. Krever Blu-ray-spiller eller annen kompatibel avspiller.

   Fri frakt - på kjøp over 249,-
   Alltid bytterett - Norges beste. Bytt uten kvittering.

    Om Algorithms in C++

    Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewicks work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewicks complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

    Kundevurderinger

    Totalvurdering: 

    Gi din vurdering: 
    Totalvurdering: 

    Detaljer

    Format
    E-Bok
    Kopisperre
    Teknisk DRM
    Filformat
    ePUB
    Utgivelsesår
    1998
    Forlag
    Pearson Education
    Språk
    Engelsk
    ISBN
    9780768685039
    Sider
    752

    Anbefalt