lecture notes

Bubble Sort, Selection Sort
O(n^2)
as n got really big, problem couldn't be solved in our lifetimes

analyze algorithms

Insertion Sort, also, modification of radix sort

http://en.wikipedia.org/wiki/Insertion_sort
also O(n^2)

modification of radix sort
call range of the numbers m
O(n + m)

if n is a billion
and m is a billion

analyze algorithms to choose appropriate method

http://www.claymath.org/millennium/


traveling salesman problem

generate all possible permutations of cities
then add up cost of all roads
find the minimum
for four cities, 4!
4 x 3 x 2 x 1


what if i have 100 cities?

how many perms? 100!

2^100 < 100!

http://en.wikipedia.org/wiki/Traveling_salesman_problem

von Neumann architecture
not able to solve it


multiprocessor machines
distributed computing

http://en.wikipedia.org/wiki/DNA_computing
http://en.wikipedia.org/wiki/Quantum_computing

HTML
http://www.w3schools.com/html/html_formatting.asp

gradual move from marking up formatting explicitly to marking up meaning
we'll see more in CSS (cascading style sheets)

font tag
deprecated
instead, we use CSS
style