Md. Mahbubur Rahman 60c608d85a Added matrix exponentiation approach for finding fibonacci number. (#1042)
* Added matrix exponentiation approach for finding fibonacci number.

* Implemented the way of finding nth fibonacci.
* Complexity is about O(log(n)*8)

* Updated the matrix exponentiation approach of finding nth fibonacci.

- Removed some extra spaces    
- Added the complexity of bruteforce algorithm  
- Removed unused function called zerro()  
- Added some docktest based on request

* Updated the matrix exponentiation approach of finding nth fibonacci.

- Removed some extra spaces
- Added the complexity of bruteforce algorithm
- Removed unused function called zerro()
- Added some docktest based on request

* Tighten up main() and add comments on performance
2019-07-19 09:41:37 +02:00
2019-07-06 14:04:27 +05:30
2019-07-14 07:45:54 +02:00
2018-10-20 14:45:08 -05:00
2018-11-12 23:38:08 +05:30
2019-07-18 23:40:51 +02:00
2018-10-19 17:14:25 -05:00
2019-07-13 21:54:38 +02:00
2019-05-26 22:03:53 +05:30
2019-06-02 12:14:18 +08:00
2019-07-10 06:59:39 +02:00

The Algorithms - Python

Donate   Gitter chat   Open in Gitpod

All algorithms implemented in Python (for education)

These implementations are for learning purposes. They may be less efficient than the implementations in the Python standard library.

Owners

Anup Kumar Panwar   [Gmail   GitHub   LinkedIn]

Chetan Kaushik   [Gmail   GitHub   LinkedIn]

Contribution Guidelines

Read our Contribution Guidelines before you contribute.

Community Channel

We're on Gitter! Please join us.

Algorithms

See our directory.

Languages
Python 99.9%
Shell 0.1%