How to check if a given point lies inside or outside a polygon – Geometric Algorithm – To handle this, after checking if the line from ‘p’ to extreme.
Algorithm
A Boolean Array Puzzle – Bit Algorithm – Following are the specifications to follow. It is guaranteed that one element is 0 but we do not know its position
How to check if two given line segments intersect? – Geometric Algorithms – Orientation of an ordered triplet of points in the plane.
Cpp Algorithm – Breadth First Traversal or BFS for a Graph – Graph Algorithms – Breadth First Traversal for a graph is similar to Breadth First Traversal.
Smallest of three integers without comparison – Bit Algorithm – Take a counter variable c and initialize 0. In a loop, repeatedly subtract x, y and z by 1.
C Programming – Check divisibility by 7 – Mathematical Algorithms – Divisibility by 7 can be checked by a recursive method. A number of the form 10a + b.
C++ Programming-Backtracking Set 6 (Hamiltonian Cycle) – Backtracking – Hamiltonian Path in an undirected graph is a path that visits each vertex exactly.
C Programming – Given a number, find the next smallest palindrome – Mathematical Algorithms – For example, if the input number is “2 3 5 4 5”.
Add two numbers without using arithmetic operators – Bit Algorithm – Sum of two bits can be obtained by performing XOR (^) of the two bits.
C++ Programming-Backtracking Set 5 – Backtracking – Given an undirected graph and a number m, determine if the graph can be colored with most m colors such that no two adjacent vertices of the graph are colored with same color.