Find n-th Fibonacci Number:
The n-th Fibonacci number is the sum of the (n-1)th and the (n-2)th where F(0)=1 and F(1) =1.
The given C++ software program shall calculate the given n-th number for Big Integers. (For example, the given input can be 135463213424513312623 where the given and resultant number cannot fit into unsigned long long.)
Big Integer class definition shall be done.
Instead of using old C++ features, modern C++11 features shall be used. (C++14 is also accepted)
The code shall be written elegantly in professional manner. (class, function and attribute names shall be named carefully. comment lines shall be written)
The code shall be compiled in Linux operating system.
Instead of Boost, POCO or ACE libraries, standard C++ libraries shall be used.
20 freelancers are bidding on average $76 for this job
Hello, I can do this project. As can be seen from the fibonacci function, it is only necessary to implement plus and minus operations for big numbers then everything is sorted. Let me do that for you in "1 HOUR".
I will take your project quickly and efficiently. I have experience in the use of C++ 11, C++14. You can find examples of my projects at next link: https://github.com/Lokki23
I already done it so let me know if you need this for real let me know asap so I could give you what I done if you are lazy to pay look here http://stackoverflow.com/questions/117429/handling-large-numbers-in-c