|
26 | 26 | * [Topological Sort](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/12%20Topological%20Sort.cpp)
|
27 | 27 | * [Strongly Connected Component (SCC)](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/13%20Strongly%20Connected%20Component.cpp)
|
28 | 28 |
|
| 29 | +<h3> <b><i>Number Theory</i></b> </h3> |
| 30 | + |
| 31 | +* ***Power & Modulus*** |
| 32 | + * [Power](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/18%20Power.cpp) |
| 33 | + * [Big Mod](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/19%20BigMod.cpp) |
| 34 | + * [Inverse Mod](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/20%20InvMod.cpp) |
| 35 | +* [***Extended Euclidean Algorithm***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/28%20Extended%20Euclid.cpp) |
| 36 | +* [***nCr***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/21%20nCr.cpp) |
| 37 | +* ***Sieve of Eratosthenes*** |
| 38 | + * [General Sieve](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/22%20Sieve%20of%20Eratosthenes.cpp) |
| 39 | + * [Bit Sieve](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/23%20Bit%20Sieve.cpp) |
| 40 | + * [Segmented Sieve](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/24%20Segmented%20Sieve.cpp) |
| 41 | +* [***Prime Factorization***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/25%20Prime%20Factorization.cpp) |
| 42 | +* [***Divisors***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/26%20Divisors.cpp) |
| 43 | + * Number of Divisors |
| 44 | + * Cumulative Sum of Number of Divisors |
| 45 | + * Sum of Divisors |
| 46 | + * Cumulative Sum of Sum of Divisors |
| 47 | +* [***Euler Totient***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/27%20Euler%20Totient.cpp) |
| 48 | +* ***Linear Diophantine*** |
| 49 | + * [2 Variable](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/29%20Linear_Diophantine.cpp) |
| 50 | + * [3 Variable](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/31%20Linear%20Diophantine%20(3%20variable).cpp) |
| 51 | + * [Number of solutions in a range](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/30%20Linear%20Diophantine%20(Number%20of%20solution%20in%20a%20range).cpp) |
| 52 | +* [***Highest Composite Number***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/32%20Highest%20Composite%20Number.cpp) |
| 53 | +* [***Factorials***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/33%20Factorials.cpp) |
| 54 | + * Number of digits in N factorial |
| 55 | + * Prime Factorization of N Factorial O(N*log(N)) |
| 56 | + * Find the first K digits of N! |
| 57 | +* [***Chinese Remainder Theorem***](https://github.com/zarif98sjs/Advanced-Data-Structure-and-Algorithm/blob/master/Algorithm/34%20Chinese%20Remainder%20Theorem.cpp) |
| 58 | + |
| 59 | + |
29 | 60 | <h3> <b><i>Search Technique</i></b> </h3>
|
30 | 61 |
|
31 | 62 | * ***Binary Search***
|
|
0 commit comments