GCD of Two Integers Using Euclid’s Algorithm Theory ✔ Brief Introduction : The Greatest Common Divisor, commonly known as GCD, ...
Showing posts with label DAA. Show all posts
Showing posts with label DAA. Show all posts
UNIT II - Divide and Conquer General Method
Divide and Conquer: General Method Introduction: Dividing a big problem into smaller, more manageable subproblems is a fundamental algorith...
DAA - Strassen's Matrix Program with Output(BCA- IV sem GFGCW JKD/KSWU)
SOURCE CODE : #include<stdio.h> #include<conio.h> #include<time.h> int main() { clock_t start,end; double ctu; int a[2]...
DAA - Factorial Program ,algorithm and with OUTPUT(BCA- IV sem KSWU)
Factorial Program SOURCE CODE : #include<stdio.h> #include<conio.h> #include<time.h> long int multiplyNumbers(int n); int...
DAA - Dijkstra Program
Write a Program to implement Dijkstra’s algorithm for the Single source shortest path problem Algorithm: //G be a graph //Cost m...
DAA - FIND MAX MIN Element from MATRIX(BCA-IV Sem KSWU)
8. Program to find Maximum and Minimum elements in a matrix SOURCE CODE : #include<stdio.h> #include<time.h> int main() { cl...
DAA - QuickSort Problem(BCA- IV Sem KSWU)
Quicksort Quicksort is a sorting algorithm that utilizes the divide and conquer strategy. It works by dividing the input array into s...
DAA - Knapsack Problem(BCA-IV Sem KSWU)
Knapsack fractional problem The Knapsack fractional problem is a variation of the classic Knapsack problem, where items can be divided ...
DAA - Kruskal's algorithm(BCA-IV sem KSWU)
Kruskal's algorithm The Kruskal's algorithm is a algorithm used to find the minimum spanning tree (MST) of a given graph. ...
DAA - Dijkstra's algorithm(BCA-IV semKSWU)
Dijkstra's algorithm Dijkstra's algorithm is a algorithm used in the field of design and analysis of algorithms. It helps us...
DAA - Greedy Techniques in Design and Analysis of Algorithms
Greedy Techniques in Design and Analysis of Algorithms Introduction: In the realm of algorithm design and analysis, various strategies and...
DAA - Prims's Algorithm - steps to solve problem
Prim's Algorithm Introduction: Prim's algorithm is a widely used algorithm in computer science that helps find the m...
DAA - 6.Merge sort (BCA-IV sem lab KSWU)
6. Program to sort N Numbers using MERGE SORT ALGORITHM : Step 1 : Declare left and right var which will mark the extreme indices of th...