Python algorithm – Breadth First Traversal or BFS for a Graph – Breadth First Traversal for a graph is similar to Breadth First Traversal of a tree
Algorithm
Applications of Depth First Search – Graph Algorithms – Depth-first search (DFS) is an algorithm (or technique) for traversing a graph.
C Programming Efficient program to calculate e^x – Mathematical Algorithms – The value of Exponential Function e^x can be expressed using Taylor Series.
Optimization Techniques | Set 1 (Modulus) – Bit Algorithm – The modulus operator (%) in various languages is costly operation. Ultimately every operator. must result in processor instructions. Some processors won’t have modulus instruction at hardware level
Convex Hull | Set 1 (Jarvis’s Algorithm or Wrapping) – Geometric Algorithms – The idea of Jarvis’s Algorithm is simple, we start from the leftmost point.
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.