CS 101 - 11/22/11


Approximate completion time for algorithms, 

N = 100

O(Log(N))	10-7 seconds  (Binary Search)
O(N)		10-6 seconds  (Linear Search)
O(N*Log(N))	10-5 seconds  (Quick Sort)
O(N2)		10-4 seconds  (Selection Sort)
O(N6)		3 minutes
O(2^N)		1014 years.   (Traveling Salesman)
O(N!)		10142 years.

This is from: http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=importance_of_algorithms