This paper introduces some algorithms of Fibonacci sequence calculation, analyzes the time complexity of recursive, bottom-up and Binet formula algorithms, gives a method to reduce the time complexity by using two dimension matrix multiplication, and compares the execution time of different amount of calculation among these algorithms. It modifies the long data type to BigInteger data type to resolve the data overflow problem, and compares different algorithms’execution time for large number calculation.