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[]...
Browse Category
C Programming
100 Articles
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...
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...
C Programming – Binomial Coefficient
C Programming - Binomial Coefficient - Dynamic Programming binomial coefficient can be defined as the coefficient of X^k in...
C Programming – Coin Change
C Programming - Coin Change - Dynamic Programming Coin Change problem has both properties of a dynamic programming problem....
C Programming – Random number generator in arbitrary probability distribution fashion
C Programming - Random number generator in arbitrary probability distribution fashion - Mathematical Algorithms - Given n...
Shortest Paths – C/C++ – Dijkstra’s shortest path algorithm
Shortest Paths - C/C++ - Dijkstra’s shortest path algorithm - Given a graph and a source vertex in graph, find shortest...
