Daa Front Page
Daa Front Page
Name: Siddharth
Course: BTECH(CSE)
Session: 2023 - 24
1.
Program for recursive binary
and linear search
2.
Program for heap sort
3.
Program for merge sort
4.
5.
6.
10.
11.
} else {
// Linear Search
return -1;
int main() {
// Binary Search
} else {
Faculty Name: ………………………………… Sign. With date: …...........................
Experiment No : ……………………………… Date: ……………………………
// Linear Search
} else {
return 0;
OUTPUT
printf("\n");
}
Faculty Name: ………………………………… Sign. With date: …...........................
Experiment No : ……………………………… Date: ……………………………
OUTPUT
if (l < r) { int m = l + (r -
l) / 2; mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
OUTPUT
int i;
int main() {
OUTPUT
arr[j + 1] = key;
OUTPUT
quickSort(arr, 0, n - 1);
return 0;
OUTPUT
int main() {
struct Item items[] = {{60, 10}, {100, 20}, {120, 30}}; int
n = sizeof(items) / sizeof(items[0]); int capacity = 50;
knapsackGreedy(items, n, capacity); return 0;
}
OUTPUT
};
printPath(parent, i);
printf("\n");
dist[0] = 0; parent[0]
= -1;
for (int count = 0; count < V - 1; count++) {
int u = minDistance(dist, V); visited[u] = 1;
for (int v = 0; v < V; v++) {
if (!visited[v] && graph[u][v] && dist[u] != INT_MAX &&
dist[u] + graph[u][v] < dist[v]) { dist[v] = dist[u] + graph[u]
[v]; parent[v] = u;
}} }
int main()
{ tsp();
return 0;
}
OUTPUT
#include <stdlib.h>
if (x != y) {
result[e++] = next_edge;
Union(subsets, x, y);
free(subsets);
int main()
{ int V = 4;
int E = 5;
{0, 1, 10},
{0, 2, 6},
{0, 3, 5},
{1, 3, 15},
{2, 3, 4}
};
kruskal(edges, V, E);
return 0;
OUTPUT