Showing posts with the label DSAShow all
DSA
Recurrence relation time complexity questions
Q1Quick sort recurrence relation is T(n)=T(n-1)+n find worst case time complexity . T(n)=T(n-1)+n Find T(n-1) T(n-…
Read more
DSA
Mergesort implementation in C
Mergesort implementation in C Mergesort based on divide and conquer technique. so first divide the array element recursively void mergesort ( int…
Read more
DSA
Dijkstra algorithm to find shortest path C code
Dijkstra algorithm to find shortest path C code Using dijkstra shortest path is Output enter number of node3 enter cost matrix 0 1 3 1 0 1 3 1 0 d…
Read more
DSA
Matrix chain multiplication using dynamic programming C code
Matrix chain multiplication using dynamic programming C code Consider three matrices of matrix Order A 5*4 B …
Read more
DSA
Longest common subsequence using dynamic programming C code
Longest common subsequence using dynamic programming C code Let S1=abcca S2=abcc Longest common subsequence between S1 and S2 is length 4. #i…
Read more
Social Plugin