Grokking Algorithms

Table of Contents

Copyright

Brief Table of Contents

Table of Contents

Preface

Acknowledgments

About this Book

Chapter 1. Introduction to Algorithms

Introduction

What you’ll learn about performance

What you’ll learn about solving problems

Binary search

A better way to search

Exercises

Running time

Big O notation

Algorithm running times grow at different rates

Visualizing different Big O run times

Big O establishes a worst-case run time

Some common Big O run times

Exercises

The traveling salesperson

Recap

Chapter 2. Selection Sort

How memory works

Arrays and linked lists

Linked lists

Arrays

Terminology

Exercise

Inserting into the middle of a list

Deletions

Exercises

Selection sort

Example Code Listing

Recap

Chapter 3. Recursion ...