Python Algorithm – Depth First Traversal or DFS for a Graph – Graph Algorithms – Depth First Traversal for a graph is similar to Depth First Traversal
Cpp Algorithm – Depth First Traversal or DFS for a Graph – Graph Algorithms -Depth First Traversal for a graph is similar to Depth First Traversal of a tree
Next higher number with same number of set bits – Bit Algorithm – When we observe the binary sequence from 0 to 2n ā 1 (n is # of bits),The idea is to find right most string of 1ās in x, and shift the pattern to right extreme
Java Algorithm – Depth First Traversal or DFS for a Graph -Graph Algorithms -Depth First Traversal for a graph is similar to Depth First Traversal of a tree
Program to count number of set bits in an (big) array- Bit Algorithm – The simple approach would be, create an efficient method to count set bits in a word.
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.
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.