C Algorithm – Find maximum number of edge disjoint paths between two vertices
C Algorithm - Find maximum number of edge disjoint paths between two vertices - Graph Algorithm - Given a directed graph and...
Browse Category
C Programming
100 Articles
C Programming – Partition Problem
C Programming - Partition Problem - Dynamic Programming Partition problem is to determine whether a given set can be...
C programming – Graph Coloring | Set 2 (Greedy Algorithm)
C programming - Graph Coloring | Set 2 (Greedy Algorithm) - Graph Algorithms - It doesn’t guarantee to use minimum colors,...
C Programming – Backtracking Set 8 Solving Cryptarithmetic Puzzles
C Programming - Backtracking Set 8 Solving Cryptarithmetic Puzzles - Backtracking - The goal here is to assign each letter a...
C Programming-Efficient way to multiply with 7
C Programming-Efficient way to multiply with 7 - Bit Algorithm-We can multiply a number by 7 using bit wise operator. First...
Write a C program to find the parity of an unsigned integer
Write a C program to find parity of an unsigned integer - Bit Algorithm - Parity of a number refers to whether it contains...
C Programming-Write an Efficient Method to Check if a Number is Multiple of 3
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...
C Programming-Smallest power of 2 greater than or equal to n
C Programming-Smallest power of 2 greater than or equal to n - Bit Algorithm - Write a function that, for a given no n,...
C Programming – Floyd Warshall Algorithm
C Programming - Floyd Warshall Algorithm - Dynamic Programming The Floyd Warshall Algorithm is for solving the All Pairs...
C Programming – Longest Bitonic Subsequence
C Programming - Longest Bitonic Subsequence - Dynamic Programming Array arr[0..n-1] containing n positive integers, a...
