No tree algorithms are present.
Please assign it to me.

Based on hash calculation of substring.

1. Pattern matching in a string in O(n) time (Rabin-Karp ).
2. Calculating the number of different substrings of a string in O(n2 logn).
3. Finding all sub-palindromes in O(N) .

GCD/LCM/PHI
SEIVE/FACTORIZATION
SYSTEM OF LINEAR EQUATION'S
PIGEON HOLE/ MATRIX POWER
NUMERICAL INTEGRATION
VORONOI DIAGRAM/ TRIANGLE INEQUALITY

Broken link for Strings-> Substitution cipher.

Egyptian Fraction algorithm needs to be added.If this is an valid issue I would like to work on this issue

make retrival of the sample for the new contributor.

@Bhavnaharitsa
Can I remove the duplicate text from the README file?

Sort the titles lexicographically.
#documentation

In instructions.md

In the first line it states

All algorithms must be implemented in C++

But later also lists instructions for:

Implementing an algorithm in another language

Sort titles of algorithms lexicographically in README.

Broken link of disjoint_set_union.cpp link on contributing.md page.

Fix link of Substitution cipher.

Added Backtracking Algorithms in PR #67
@Bhavnaharitsa please review.

For example, on the README.md page, links pointing to some of the sample algorithms doesn't take the user there.

Working on this.

may I add some ?

The repository does not contain the Linear Search Algorithm.

The link to Substitution Cipher is broken in readme and newer inclusions are not present.

Based on hash calculation of string.

1 .Calculation of hash (polynomial rolling hash function).
2 .Using hash calculated to Search for duplicate strings in an array of strings in O(nm+nlogn) time.

There should be subfolders for different algos like a folder for searching algorithm, a folder for sorting algorithm, greedy approach, Dynamic Programming etc..

Can this issue be assigned to me?

Please update the fork, as @abhishekchopra13 has already given instructions regarding this project in his repo.

It's not looking good. It needs to have some styling to make it attractive.