Compute the minimum or maximum of two integers without branching
Compute the minimum or maximum of two integers without branching - Bit Algorithm - On some rare machines where branching is...
Browse Category
Algorithm
477 Articles
C Programming – Horner’s Method for Polynomial Evaluation
C Programming Horner’s Method for Polynomial Evaluation - Mathematical Algorithms - Input is in form of array say poly[]...
C Program for Tower of Hanoi
C Program for Tower of Hanoi - Mathematical Algorithms - Tower of Hanoi is a mathematical puzzle where we have three rods...
C Programming – Count all possible groups
C Programming - Count all possible groups - Mathematical Algorithms - Given an unsorted integer positive values only array...
C Programming – Compute modulus division by a power of 2 number
Compute modulus division by a power of 2 number - Bit Algorithm - operators, where d is a power of 2 number.Let it bit from...
Python Programming – 0-1 Knapsack Problem
Python Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and...
Java Programming – 0-1 Knapsack Problem
Java Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and...
Cpp Programming – 0-1 Knapsack Problem
C++ Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and...
C Programming-Backtracking Set 2 (Rat in a Maze)
C Programming-Backtracking Set 2 - Backtracking - A Maze is given as N*N binary matrix of blocks where source block is the...
C Programming – 0-1 Knapsack Problem
C Programming - 0-1 Knapsack Problem - Dynamic Programming simple solution is to consider all subsets of items and calculate...
