Robert Sedgewick

Kevin Wayne

Learn how you like with full eTextbook audio

Listen on the go

Quickly navigate your eTextbook with search

Find it fast

Stay organized

Easily continue access

A digital version of the text you can personalize and read online or offline.

eTextbook

Algorithms

A digital version of the text you can personalize and read online or offline. If your instructor has invited you to join a specific Pearson eTextbook course for your class, you will need to purchase your eText through the course invite link they provide.

Now available on

<ul>
    <li>
    <div style="MARGIN: 0px"><b>Chapter 1: Fundamentals
    <li>
    <div style="MARGIN: 0px">1.1 Programming Model</div>
    <div>&nbsp;</div>
    </li>
    </b></div>
    </li>
    <li>
    <div style="MARGIN: 0px">1.2 Data Abstraction</div>
    </li>
    <li>
    <div style="MARGIN: 0px">1.3 Queues, Stacks, and Bags</div>
    </li>
    <li>
    <div style="MARGIN: 0px">1.4 Analysis of Algorithms</div>
    </li>
    <li>
    <div style="MARGIN: 0px">1.5 Case Study: Union-Find</div>
    </li>
    <li>
    <div style="MARGIN: 0px">&nbsp;</div>
    <b>
    <li>
    <div style="MARGIN: 0px">Chapter 2: Sorting</div>
    </li>
    <li>
    <div style="MARGIN: 0px">2.1 Elementary Sorts </div>
    2.1 Elementary Sorts </li>
    </b></li>
    <li>
    <div style="MARGIN: 0px">2.2 Mergesort</div>
    </li>
    <li>
    <div style="MARGIN: 0px">2.3 Quicksort</div>
    </li>
    <li>
    <div style="MARGIN: 0px">2.4 Priority Queues</div>
    </li>
    <li>
    <div style="MARGIN: 0px">2.5 Applications</div>
    </li>
    <li>
    <div style="MARGIN: 0px">&nbsp;</div>
    <b>
    <li>
    <div style="MARGIN: 0px">Chapter 3: Searching</div>
    </li>
    <li>
    <div style="MARGIN: 0px">3.1 Symbol Tables</div>
    3.1 Symbol Tables </li>
    </b></li>
    <li>
    <div style="MARGIN: 0px">3.2 Binary Search Trees</div>
    </li>
    <li>
    <div style="MARGIN: 0px">3.3 Balanced Search Trees</div>
    </li>
    <li>
    <div style="MARGIN: 0px">3.4 Hash Tables</div>
    </li>
    <li>
    <div style="MARGIN: 0px">3.5 Applications</div>
    </li>
    <li>
    <div style="MARGIN: 0px">&nbsp;</div>
    <b>
    <li>
    <div style="MARGIN: 0px">Chapter 4: Graphs</div>
    </li>
    <li>
    <div style="MARGIN: 0px">4.1 Undirected graphs</div>
    4.1 Undirected graphs </li>
    </b></li>
    <li>
    <div style="MARGIN: 0px">4.2 Directed graphs</div>
    </li>
    <li>
    <div style="MARGIN: 0px">4.3 Minimum Spanning Trees</div>
    </li>
    <li>
    <div style="MARGIN: 0px">4.4 Shortest Paths</div>
    </li>
    <li>
    <div style="MARGIN: 0px">&nbsp;</div>
    <b>
    <li>
    <div style="MARGIN: 0px">Chapter 5: Strings</div>
    </li>
    <li>
    <div style="MARGIN: 0px">5.1 String Sorts</div>
    5.1 String Sorts </li>
    </b></li>
    <li>
    <div style="MARGIN: 0px">5.2 Tries</div>
    </li>
    <li>
    <div style="MARGIN: 0px">5.3 Substring Search</div>
    </li>
    <li>
    <div style="MARGIN: 0px">5.4 Regular Expressions</div>
    </li>
    <li>
    <div style="MARGIN: 0px">5.5 Data Compression</div>
    </li>
    <li>
    <div style="MARGIN: 0px">&nbsp;</div>
    <b>
    <li>
    <div style="MARGIN: 0px">Context</div>
    </li>
    <li>
    <div style="MARGIN: 0px">Systems Programming</div>
    Systems Programming </li>
    </b></li>
    <li>
    <div style="MARGIN: 0px">Scientific Computing</div>
    </li>
    <li>
    <div style="MARGIN: 0px">Commercial Applications</div>
    </li>
    <li>
    <div style="MARGIN: 0px">Operations Research</div>
    </li>
    <li>
    <div style="MARGIN: 0px">Intractability</div>
    </li>
    <li>
    <div style="MARGIN: 0px">&nbsp;</div>
    <i>
    <li>
    <div style="MARGIN: 0px">Index</div>
    </li>
    </i></li>
</ul>

Algorithms, 4th edition