Friday, October 17 2014

last week, I review the first term test and conclude five  definitions from lectures.

1) Euclidean Algorithm         VS         Brute Force

Brute Force  needs more steps to get the result but Euclidean Algorithm has less steps. It is simply to get results.

2)Adds up           VS         Algebraic formula

Algebraic formula has less steps than Adds up method

3)The Collatz  sequence

Assume a number 10,
it is even so divide 2 get 5
it is odd so times 3 plus 1 get 16
it is even so get 8
it is even so get 4
...2
...1
 the final answer is 1,

but it is only a suspect.

4) Binary Search       VS         Brute Ford


Binary Search is the best choice because Brute Ford has many steps,Binary Search has less steps



3
5)Expentional growth
6)Fibonacci Sequence