Algorithms Number of Integral points inside a rectangle In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a rectangle. This is an important concept in the field of computational geometry.

Algorithms Number of Integral points inside a triangle In this article, we have explored an insightful approach/ algorithm to find the number of interior integral points of a triangle. This is an important concept in the field of computational geometry.

Algorithms Simple closed path in a set of points In this article, we have explored an insightful approach/ algorithm to find a simple closed path in a set of points. This is an important concept in the field of computational geometry.

Algorithms GCD Sort of an Array In this article, we have explored an insightful approach/ algorithm to sort an array by comparing the Greatest Common Divisor of two of the elements.

Algorithms 4 Array Sum equal to Zero (4Sum II) In this article, we have explored insightful approaches / algorithms to find elements in 4 arrays whose sum is equal to zero. This is an extension of 4 SUM PROBLEM.

Algorithms Making A Large Island by changing one 0 to 1 In this article, we have explored an insightful approach/ algorithm to find the largest island by changing one 0 to 1 in MxN matrix. This is an extension of Number of Islands in MxN matrix (of 0 and 1).

Algorithms Number of Islands in MxN matrix (of 0 and 1) In this article, we have explored an insightful approach/ algorithm to find the number of islands in MxN matrix. An extension of this algorithm is used by online battleship game engine.

Algorithms Maximum points on a line In this article, we have explored an insightful approach/ algorithm to find the maximum number of points on a straight line. This problem finds many uses in computational geometry.

Algorithms 4 Sum problem In this article, we have explored an insightful approach/ algorithm to find the 4 elements in an array whose sum is equal to the required answer (4 Sum problem). This concept finds many uses in computational geometry.

Algorithms Closest 3 Sum problem (Find all triplets close to the given sum) In this article, we have explored an insightful approach/ algorithm to find the 3 elements in an array whose sum is equal to or close to the required answer. This is an extension of the 3 Sum problem where the resulting sum needed not be exact.

Algorithms Number of Ordered Solution Pairs (X, Y) satisfying 1/X + 1/Y = 1/N We have explored two insightful approaches/ algorithms to find the Number of Ordered Solution Pairs (X, Y) satisfying 1/X + 1/Y = 1/N. This problem is used extensively in Astrophysics.

Algorithms Bin Packing problem Bin Packing problem involves assigning n items of different weights and bins each of capacity c to a bin such that number of total used bins is minimized. It may be assumed that all items have weights smaller than bin capacity.

List of Mathematical Algorithms Number of integers between 1 and N that are coprime to N We have explored efficient approaches to find Number of integers between 1 and N that are coprime to N. We have presented the idea of Euler Ï† (phi) function and is an important topic to get hold on Mathematical Algorithms.

Software Engineering Types of classes in C++ An important aspect of Object-oriented programming is the usage of classes and objects. We have covered different types of classes in C++ such as Standalone classes, Abstract base class, Concrete Derived Class and much more.