SQL
SQL
#include <stdio.h>
int i, j, k;
i++;
} else {
arr[k] = R[j];
j++;
k++;
arr[k] = L[i];
i++;
k++;
arr[k] = R[j];
j++;
k++;
printf("\n");
// Main function
int main() {
printf("Original array:\n");
printArray(arr, arr_size);
printf("Sorted array:\n");
printArray(arr, arr_size);
return 0;
return (a > b) ? a : b;
int i, w;
if (i == 0 || w == 0)
dp[i][w] = 0;
else
return dp[n][W];
int main() {
return 0;
}
Output:
KRUSHKALS ALGORITHM
#include <stdio.h>
struct Edge {
};
int parent[4];
int find(int i) {
while (parent[i] != i)
i = parent[i];
return i;
}
int a = find(i);
int b = find(j);
parent[a] = b;
int main() {
{2, 3, 5} // C-D
};
int i, j;
parent[i] = i;
// Sort edges based on weight (simple bubble sort for small size)
edges[j] = edges[j+1];
edges[j+1] = temp;
int totalWeight = 0;
int u = edges[i].src;
int v = edges[i].dest;
int pu = find(u);
int pv = find(v);
totalWeight += edges[i].weight;
union_set(pu, pv);
return 0;
Output:
A -- B == 1
B -- D == 2
A -- D == 3