Skip to content

Latest commit

 

History

History
65 lines (47 loc) · 1.97 KB

README.md

File metadata and controls

65 lines (47 loc) · 1.97 KB

Hacktoberfest2021 Recursion Hub

Write the solution of any recursive problem in any language of your choice. You Don't Need to write an optimal solution just write code with help of Recursion.

none

Maker sure to flow instruction bellowed.

1. Fork and clone this repository.

2. Create new branch with your name (Find more details)

3. Select any problem which can solve by recursion. Make sure your problem is not present in the list below.

4. Select any programing language of your choice(Write code in ./Code folder only). and write code to solve the problem(Make sure file name explain the problem in brief). and add the problem in list.

5. In Code make sure to add two sections in the comment.

  1. Contributor Introduction
/**
* Contributor🎅
* Name: Your Github Name
* Github: Your Github Url
* WebSite(optional): Your Personal Website Url
*/
  1. About Problem
/**
* 👉 Problem: Nth FibonacciNumber
* 👑 Description: Find the Nth Fibonacci Number.
* 🎓 Explanation(optional):Any fibonacci number is give by sum of last two fibonacci number
*    before the number.
*    Ex.
*    F(N):  0 1 1 2 3 5 8 13 21...
*    N   :  0 1 2 3 4 5 6  7  8....
*    f(n)= {
*               0 for  n==0
*               1 for n==1
*               f(n-1)+f(n-2) otherwise
*          }
*/

Hole Code

6. Add problem name in the list given below and make sure two problems are not the same

List

Rules

  1. Try to add some value and don't spam
  2. Just follow the instructions given above and you are good to go.

Thanks You