Op werkdagen voor 23:00 besteld, morgen in huis Gratis verzending vanaf €20
010-4091959
Robert Sedgewick Meer over Robert Sedgewick

Algorithms in C, Parts 1-4

Fundamentals, Data Structures, Sorting, Searching
Specificaties
E-book, blz. | Engels
Pearson Education | e druk, 2021
ISBN13: 9780134190136
Rubricering
Juridisch :
Pearson Education e druk, 2021 9780134190136
Verwachte levertijd ongeveer 9 werkdagen
89,79
In winkelwagen
 

Samenvatting

Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. 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 Sedgewick's work an invaluable resource for more than 250,000 programmers!

This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. It 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 you can both appreciate their fundamental properties and test them on real applications. Of course, the substance of the book applies to programming in any language.

Highlights 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 for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, Batcher's sorting networks, randomized BSTs, splay trees, skip lists, multiway tries, and much more Increased quantitative information about the algorithms, including extensive empirical studies and basic analytic studies, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms

Whether you are a student learning the algorithms for the first time or a professional interested in having up-to-date reference material, you will find a wealth of useful information in this book.

Specificaties

ISBN13:9780134190136
Taal:Engels
Bindwijze:e-book
Uitgever:Pearson Education

Inhoudsopgave

<p> I. FUNDAMENTALS. </p> <div style="margin-left: 0.2in;"> Introduction. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> A Sample Problem -- Connectivity. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Union-Find Algorithms. Perspective. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Summary Of Topics. </div> <p></p> <div style="margin-left: 0.2in;"> Principles Of Algorithm Analysis. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Empirical Analysis. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Predictions And Guarantees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Growth Of Functions. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Big-Oh Notation. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Example: Connectivity Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Computational Complexity. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Perspective. </div> <p></p> <p> II. DATA STRUCTURES. </p> <div style="margin-left: 0.2in;"> Elementary Data Structures. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Types And Structures. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Arrays. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Linked Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Elementary List Processing. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Storage Allocation For Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Strings. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Compound Structures. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Perspective. </div> <p></p> <div style="margin-left: 0.2in;"> Trees And Recursion. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Properties Of Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Representing Binary Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Representing Forests. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Traversing Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Elementary Recursive Programs. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Divide-And-Conquer. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Depth-First Search. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Removing Recursion. </div> <p></p> <div style="margin-left: 0.2in;"> Elementary Abstract Data Types. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Pushdown Stack Adt. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Stack Adt Implementations. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Queue Adts And Implementations. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> String Adt And Implementations. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Set Adt And Implementations. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Amortized Growth For Array Implementations. </div> <p></p> <p> III. SORTING. </p> <div style="margin-left: 0.2in;"> Elementary Sorting Methods. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Rules Of The Game. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Selection Sort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Insertion Sort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Bubble Sort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Performance Characteristics Of Elementary Sorts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Shellsort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Sorting Other Types Of Data. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Index And Pointer Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Sorting Linked Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Distribution Counting. </div> <p></p> <div style="margin-left: 0.2in;"> Quicksort. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> The Basic Algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Performance Characteristics Of Quicksort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Stack Size. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Small Subfiles. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Median-Of-Three Partitioning. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Equal Keys. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Strings And Vectors. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Selection. </div> <p></p> <div style="margin-left: 0.2in;"> Mergesort. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Two-Way Merging. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Abstract Implace Merge. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Top-Down Mergesort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Improvements To The Basic Algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Bottom-Up Mergesort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Performance Characteristics Of Mergesort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Linked-List Implementations Of Mergesort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Recursion Revisited. </div> <p></p> <div style="margin-left: 0.2in;"> Priority Queues And Heapsort. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Elementary Implementations. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Heap Data Structure. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Algorithms On Heaps. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Heapsort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Priority-Queue Abstract Data Type. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Indirect Priority Queues. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Binomial Queues. </div> <p></p> <div style="margin-left: 0.2in;"> Radix Sorting. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Bits, Bytes, And Words. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Binary Quicksort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Msd Radix Sort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Three-Way Radix Quicksort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Lsd Radix Sort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Performance Characteristics Of Radix Sorts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Sublinear-Time Sorts. </div> <p></p> <div style="margin-left: 0.2in;"> Special-Purpose Sorts. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Batcher's Odd-Even Mergesort. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Sorting Networks. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> External Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Sort-Merge Implementations. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Parallel Sort/Merge. </div> <p></p> <p> IV. SEARCHING. </p> <div style="margin-left: 0.2in;"> Symbol Tables And Bsts. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Symbol-Table Abstract Data Type. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Key-Indexed Search. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Sequential Search. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Binary Search. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Binary Search Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Performance Characteristics Of Bsts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Index Implementations With Symbol Tables. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Insertion At The Root In Bsts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Bst Implementations Of Other Adt Functions. </div> <p></p> <div style="margin-left: 0.2in;"> Balanced Trees. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Randomized Bsts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Splay Bsts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Top-Down 2-3-4 Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Red-Black Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Skip Lists. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Performance Characteristics. </div> <p></p> <div style="margin-left: 0.2in;"> Hashing. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Hash Functions. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Separate Chaining. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Linear Probing. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Double Hashing. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Dynamic Hash Tables. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Perspective. </div> <p></p> <div style="margin-left: 0.2in;"> Radix Searching. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Digital Search Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Tries. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Patricia. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Multiway Tries And Tsts. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Text String Index Applications. </div> <p></p> <div style="margin-left: 0.2in;"> External Searching. </div> <br> <p> </p> <div style="margin-left: 0.4in;"> Indexed Sequential Access. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> B-Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Extendable Hashing. </div> <p></p> <p> </p> <div style="margin-left: 0.4in;"> Virtual Memory. </div> <p></p> <div style="margin-left: 0.2in;"> Program Index. </div> <br> <div style="margin-left: 0.2in;"> List Of Figures. </div> <br> <div style="margin-left: 0.2in;"> Index. </div> <br> <div style="margin-left: 0.2in;"> Epilogue. 0201314525T04062001 </div> <br>

Net verschenen

Rubrieken

Uw cookie-instellingen
Deze website maakt gebruik van verschillende soorten cookies. Sommige cookies worden geplaatst door diensten van derden die op onze pagina's worden weergegeven. Om deze externe content te kunnen tonen is nodig dat u toestemming geeft voor het zetten van persoonlijke en marketingcookies. U kunt uw toestemming op elk moment wijzigen of intrekken. In onze cookieverklaring vindt u meer informatie.

Populaire producten

    Personen

      Trefwoorden

        Algorithms in C, Parts 1-4

        Recensiebeleid
        Noordhoff terugkoopgarantie

        Noordhoff koopt jouw boek terug, zonder zorgen!

        Heb je jouw boeken niet meer nodig?

        Als je jouw studieboeken gekocht hebt bij hanzestudybook.nl, kun je geselecteerde titels moeiteloos terugverkopen aan Noordhoff. Geen vragen, geen gedoe en lekker duurzaam.

        Volledige informatie op Noordhoff.nl

        AI-book

        Wat is een AI-book?

        Een AI-book is niet een boek dat geschreven is door AI maar een boek dat verrijkt is met AI. Het maakt de inhoud van een boek interactief via WhatsApp, zodat je ermee kunt chatten. Zie het als een razend slimme assistent die het boek perfect begrijpt en er alles uit onthouden heeft. Jij kunt deze assistent alles vragen. Vraag bijvoorbeeld hoe je iets kunt toepassen op jouw persoonlijke situatie, om een korte samenvatting, of wat de belangrijkste inzichten zijn. AI-books zijn alleen te gebruiken via WhatsApp, je hoeft er geen aparte app voor te installeren.
        Meer informatie over AI-books

        ?

        Geef uw beoordeling

        Algorithms in C, Parts 1-4

        Verwijder uw beoordeling