GCD and LCM
- LCM of array
- GCD of array
- Basic and Extended Euclidean algorithms
- Stein’s Algorithm for finding GCD
- GCD, LCM and Distributive Property
- Count number of pairs (A <= N, B <= N) such that gcd (A, B) is B
- Program to find GCD of floating point numbers
- Series with largest GCD and sum equals to n
- Largest Subset with GCD 1
- Summation of GCD of all the pairs up to N
Mathematical Algorithms
Mathematical algorithms in Data Structures and Algorithms (DSA) are fundamental tools used to solve various computational problems efficiently. These algorithms leverage mathematical concepts and principles to optimize solutions for tasks such as sorting, searching, and graph traversal . By applying mathematical techniques, these algorithms aim to enhance performance, reduce complexity, and provide precise solutions in the realm of computer science and programming.
Contact Us