C Algorithm – Find maximum number of edge disjoint paths between two vertices – Graph Algorithm – Given a directed graph and two vertices in it, source
C Programming
100 Articles
100
C Programming – Partition Problem – Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets
C programming – Graph Coloring | Set 2 (Greedy Algorithm) – Graph Algorithms – It doesn’t guarantee to use minimum colors, but it guarantees an upper bound
C Programming – Backtracking Set 8 Solving Cryptarithmetic Puzzles – Backtracking – The goal here is to assign each letter a digit from 0 to 9 .The rules are that all occurrences of a letter.
C Programming-Efficient way to multiply with 7 – Bit Algorithm-We can multiply a number by 7 using bit wise operator. First left shift the number by 3 bits.
Write a C program to find parity of an unsigned integer – Bit Algorithm – Parity of a number refers to whether it contains an odd or even number of 1-bit
C Programming-Write an Efficient Method Check if a Number is Multiple of 3 -If sum of digits in a number is multiple of 3 then number is multiple of 3 e.g.,You have to get all decimal digits one by one, add them and then check if sum is multiple of 3.
C Programming-Smallest power of 2 greater than or equal to n – Bit Algorithm – Write a function that, for a given no n, finds a number p which is greater
C Programming – Floyd Warshall Algorithm – Dynamic Programming The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem.
C Programming – Longest Bitonic Subsequence – Dynamic Programming Array arr[0..n-1] containing n positive integers, a subsequence of arr[] is called Bitonic