Euclid’s Algorithm The Traveling Algorithms

Salesman Problem The Secret Rules of Modern Living


The Problem Mathematician Professor Marcus du Sautoy

The Problem
Algorithms are little more than a
series of
__________________________

The best algorithms are those that

Sketch it Out tap into the
Sketch it Out _________________________________
hiding beneath a problem. 


The first algorithm was developed

by the ancient Greek
mathematician _______________. It
is a method of finding the
__________________________________


The criteria for an algorithm:


1.
__________________________________

2.
__________________________________

3.
Application Application __________________________________


Heuristics:
__________________________________



__________________________________
Gale-Shapley Sorting Algorithms Google’s PageRank
Algorithm Algorithm
The Problem
Stable Marriage Problem The Problem

Bubble Sort

Sketch it Out Sketch it Out

Merge Sort


Application Application
 Algorithms Use Q for quarter, D for dime, and N for nickel.

Example: 

The Secret Rules of Modern Living
 START: Q D D D N Q N D

Mathematician Professor Marcus du Sautoy
.25 .35 .45 .55 .60 .85 .90 1.00

Practice

In order to help you understand how much

algorithms impact our daily lives, let’s consider
something you probably pass every day: a soda
machine.

Suppose you want to buy a soda that costs $1.00

and you want to pay with coins. Most soda machines
only take quarters, dimes, and nickels.

How many different ways could you could you pay if

your first coin is a quarter? Write all your
possibilities on the right hand of this page (an
example is done for you).

After you write as many possibilities you can think

of, consider if you wrote every possible combination
down. Why or why not?

Is there an algorithm that could be written for a soda

machine to recognize when the total payment of a
dollar has been received, no matter the order of the
coins? What kind of algorithm? Could you write it?