Algorithms.ppt

Algorithms 國立清華大學資訊工程學系 Josephus Problem Flavius Josephus is a Jewish historian living in the 1st century. According to his account, he and his 40 comrade soldiers were trapped in a cave, surrounded by Romans. They chose suicide over capture and decided that they would form a circle and start killing one by skipping every two others. By luck, or maybe by the hand of God, Josephus and another man remained the last and gave up to the Romans. Outline The first algorithm Model, simulation, algorithm primitive The second algorithm Algorithm discovery, recursion The third algorithm Solving recursion, mathematical induction The central role of computer science Why study math? * * * * * * * * * * * * * * * * Guess the Solution f(n) = 2k+1 k = n – the first number in n’s group The first number in n’s group is 2m. 2m ? n 2m+1 How fast can you find m? (1) use “binary search” on the bit pattern of n Since n has log2(n) bits, it takes log2(log2(n)) steps. (2) use “log2” function and take its integer part It takes constant time only. (independent of n.) Verify the Solution If f(n)=2k+1, k=n–2m is the solution, it must satisfy the recursion How to prove it? Hint: using mathematical induction Comparison of 3 Algorithms Running time n 10 3 10 4 10 5 10 6 10 7 10 8 10 -8 10 -6 10 -4 10 -2 10 0 10 2 Algorithm 1 Algorithm 2 Algorithm 3 The Central Role of Computer Science Why study math? Algorithms Studied so Far In chap 1, binary and decimal conversion, 2’s complement calculation, data compression, error correction, encryption… In chap 2, we studied how to use computer to implement algorithms In homework 4, we have problems for pipeline, prefix sum (parallel algorithm), and virtual memory page replacement (online algorithm) In chap 3, we saw examples of using algorithms to help manage resources Virtual memory mapping, scheduling, concurrent processes execution, etc. In chap 4, we learned protocols (distributed, randomized algorithms) CSMA/CD, CSMA/CA, routing, handsha