Floyd Warshall | DAA
Example: // Floyd-Warshall Algorithm in C #include <stdio.h> // defining the number of vertices #define nV 4 #define INF 999 void print…
ADA
Matrics Chain Order | DAA
Example: #include <stdio.h> #include <limits.h> #define INFY 999999999 long int m [ 20 ][ 20 ]; int s [ 20 ][ 20 ]; int p [ 20 …
Dijkstra's algorithm | DAA
Example: #include <stdio.h> #include <conio.h> #define INFINITY 9999 #define MAX 10 void Dijkstra ( int G [ MAX ][ MAX ]…
Knapsack Problem Solution using Greedy Approach | DAA
Solving the Knapsack Problem using Greedy Approach What is the Knapsack Problem? The knapsack problem is a classic optimization pro…
Activity Selection | DAA
What is Activity selection? The Activity Selection Problem is an optimization problem which deals with the selection of non-conflicting activities …
Task Scheduling | DAA
What is task scheduling? Scheduling is the process by which you plan how you'll use your time. Doing it well can maximize your effectiveness an…
Merge Sorting technique using Divide and Conquer approach
What is Merge sort? Merge sort is one of the most efficient sorting algorithms. It is based on the divide-and-conquer strategy. Merge sort continuou…
Quick Sorting technique using Divide and Conquer approach | DAA
What is meant by quick sort? Image result for Quick Sorting Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' el…