- LCM Using Recursion Technique:- Least or lowest common multiple (LCM) of two integers a and b is the smallest positive number that is divisible by both a and b. Find the LCM of the two numbers using the recursion technique.
- Strassen’s Matrix Multiplication Algorithm:- There are three methods to find Matrix Multiplication. These are:- Naive Method, Divide and Conquer Method, and Strassen’s Method. The major work in matrix multiplication is multiplication only. So, the idea is:- if we reduced the number of multiplications then that will make the matrix multiplication faster. Strassen had given another algorithm for finding the matrix multiplication. Unlike a simple divide and conquer method which uses 8 multiplications and 4 additions, Strassen’s algorithm uses 7 multiplications which reduces the time complexity of the matrix multiplication algorithm a little bit.
- Linear Search:- The Linear search or Sequential search is a method to finding an element within a given list or array. Linear search or Sequential search is usually very simple to implement and is practical when the list has only a few elements, or when performing a single search in an unordered list.
- Binary Search:- Binary search is an efficient algorithm for finding an item from a sorted list or array of items. Sometimes it is also known as half-interval search, logarithmic search, or binary chop. Condition for the binary search:- The array must be sorted in ascending order.