Algorithm Design Manual Exercises and Solutions

1 - Introduction to Algorithm Design

1-1

Problem

Show that $a+b$ can be less than $\min(a,b)$.

Solution

Some solution.

Hints

culpa ad laboris amet esse officia est laboris ullamco eiusmod laborum officia nostrud ipsum id deserunt reprehenderit nostrud irure in ad enim amet quis eiusmod consequat duis ea magna reprehenderit sunt ipsum ex fugiat nostrud enim eu id Lorem sint do amet ad adipisicing ipsum irure magna cupidatat mollit adipisicing

---

1-2

Problem

Show that $a\times b$ can be less than $\min(a,b)$.

Solution

Some solution.

Hints

Some hint.

---

1-3

Problem

Design/draw a road network with two points $a$ and $b$ such that the fastest route between $a$ and $b$ is not the shortest route.

Solution

tbd

Hints

tbd

---

2 - Algorithm Analysis

TBD

3 - Data Structures

TBD

4 - Sorting

TBD

5 - Divide and Conquer

TBD

6 - Hashing and Randomized Algorithms

TBD

7 - Graph Traversal

TBD

8 - Weighted Graph Algorithms

TBD

9 - Combinatorial Search

TBD

10 - Dynamic Programming

TBD

11 - NP-Completeness

TBD

12 - Dealing with Hard Problems

TBD

13 - How to Design Algorithms

TBD