amartya-k / recursive-algorithm

Make you're first pull request!

Recursive-Algorithm

HACTOBERFEST

Make your first pull request.

Task:

-Write any algorithm of your choice in recursive form in any language.

A recursive method is a method that is defined in terms of itself. The general idea behind recursion is that a problem lends itself to a recursive solution if the problem can be broken down into a smaller version of the same problem. A non-CS example of this is the Matroyshka doll. A mathematical example of this is the computation of the factorial of a number. factorial(N) is N*factorial(N-1).

Steps:

• Fork this Repository using the button at the top
• Clone your forked repository to your pc
• Create a new branch for your modifications (ie. git branch new-user and check it out git checkout new-user and git checkout -b new-user)
• Create your file in a folder and set the folder name to the algorithm's name.
• Add your files (git add -A), commit (git commit -m "algorithm_name in language_name") and push (git push origin new-user)
• Create a pull request
• Star this repository
• Wait for Pull Request to merge
• Celebrate - you've done your first pull request!!
• Additional: You can add yourself to the contributors list by editing the README.md file.

Note:

• Upload your own file.
• Do not modify other's file.
• Give some working test cases.
• PR for similar implementation in similar language won't be considered or accepted.

---

CONTRIBUTORS

Sl. No.	Name	Institution	Country	Language Added
1	Amartya Kalapahar	N.M.A.M. Institute Of Technology, Nitte	India	C
2	Ajit Panigrahi	GITAM, Visakhapatnam Campus	India	Python
3	Sayan Deb Sarkar		India	C++
4	Nidhi Shetty		India	C++
5	Marco Wang	University of Taipei	Taiwan	Java
6	Rohit Kumar	BIET Jhansi	India	Java
7	Ravi Ranjan Singh		India	Java
8	Vishal Agrawal	BIET Jhansi	India	Python
9	Sanya Gupta		India	C
10	Omar Ahmed		Egypt	C++
11	Ghanender Singhl	NIT WARANGAL	India	Python

recursive-algorithm's Issues

Contributors List

After writing your algorithm and doing all the necessary stuff add yourself to the contributors list in the README file. This will show your hard work and determination. Thanks a-lot for participating.

Multiply two strings

Write a program to multiply two strings.
Eg:

string1 = "12" 
string2 = "5"
Output = "60"

Input size can by anything(might exceed unsigned long long int if using c++).
Any other languages please try to do it without using inbuilt methods.
Hint: Represent the number as array.

Four adjacent digits problem

The four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.

73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450

(ignore the spaces)

Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?

Algorithm Ideas

Ideas:

1. Sorting Algorithms
2. Searching Algorithms
3. DP
4. Graph Algorithms

Please read the steps in README.md carefully before submitting pull request.