| 1 | Euclidean Algorithm | Used to find the greatest common divisor of two integers. |
| 2 | Extended Euclidean Algorithm | An extension of Euclidean, computes the integers coefficients of Bézout’s identity |
| 3 | Quadratic Formula | Used to solve any quadratic equation. |
| 4 | Newton’s Method | An iterative method for finding successively better approximations to the roots. |
| 5 | Gauss-Jordan Elimination | Algorithm for solving systems of linear equations. |
| 6 | Gaussian Elimination | Used to solve systems of linear equations. |
| 7 | Fast Fourier Transform Algorithm | Efficient method to compute the discrete Fourier transform and its inverse. |
| 8 | Strassen’s Algorithm | An algorithm for matrix multiplication which is faster than naive multiplication. |
| 9 | Polynomial Long Division | Procedure for dividing a polynomial by another polynomial of the same or lower degree. |
| 10 | Newton-Raphson Division | Utilized for finding the root of a real-valued function. |
| 11 | Horner’s Scheme | Efficient algorithm for evaluating polynomial expressions. |
| 12 | Polynomial Interpolation Algorithm | To construct new data points within the range of discrete set of known data points. |
| 13 | Fibonacci Algorithm | Generates the n’th Fibonacci number. |
| 14 | Roots of Unity | Solves problems related to nth roots of 1 in complex numbers. |
| 15 | Primality Testing | To check whether a given number is prime or not. |
| 16 | Sieve of Eratosthenes | An ancient algorithm for finding all prime numbers up to a specified integer. |
| 17 | Chinese Remainder Theorem | Finds the smallest positive integer which satisfies a series of remainder conditions. |
| 18 | Schoof’s Algorithm | Computes the number of points on an elliptic curve over a finite field. |
| 19 | Shor’s Algorithm | A quantum algorithm for integer factorization. |
| 20 | Berlekamp-Massey Algorithm | A linear-feedback shift register (LFSR) synthesis algorithm. |
