SHREE MEDHA DEGREE COLLEGE, BALLARI

1. Write a program to sort a list of N elements using Selection Sort Technique.

#include <stdio.h>
int main()
{
int a[20], i, j, n, temp, s;
{
printf("Enter the size of an array\n");
scanf("%d", &n);
printf("Enter %d array elements\n", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++)
{
s = i;
for (j = i + 1; j < n; j++)
{
if (a[j] < a[s])
s = j;
}
temp = a[s];
a[s] = a[i];
a[i] = temp;
}
printf("The sorted elements are…\n");
for (i = 0; i < n; i++)
printf("%3d", a[i]);
}
return 0;
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
-----------------------------------------OUTPUT----------------------------------------
Enter the size of an array
5
Enter 5 array elements
10 88 46 32 13
The sorted elements are...
10 13 32 46 88

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
2. Write a program to perform the Travelling Salesman Problem.
#include <stdio.h>
int ary[10][10], completed[10], n, cost = 0;
void takeInput()
{
int i, j;
printf("Enter the number of villages: ");
scanf("%d", &n);
printf("\nEnter the Cost Matrix\n");
for (i = 0; i < n; i++)
{
printf("\nEnter Elements of Row: %d\n", i + 1);
for (j = 0; j < n; j++)
scanf("%d", &ary[i][j]);
completed[i] = 0;
}
printf("\n\nThe cost list is:");
for (i = 0; i < n; i++)
{
printf("\n");
for (j = 0; j < n; j++)
printf("\t%d", ary[i][j]);
}
}

void mincost(int city)

{
int i, ncity;
completed[city] = 1;
printf("%d--->", city + 1);
ncity = least(city);
if (ncity == 999)

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
{
ncity = 0;
printf("%d", ncity + 1);
cost += ary[city][ncity];
return;
}
mincost(ncity);
}

int least(int c)
{
int i, nc = 999;
int min = 999, kmin;
for (i = 0; i < n; i++)
{
if ((ary[c][i] != 0) && (completed[i] == 0))
if (ary[c][i] + ary[i][c] < min)
{
min = ary[i][0] + ary[c][i];
kmin = ary[c][i];
nc = i;
}
}

if (min != 999)
cost += kmin;
return nc;
}

int main()
{
takeInput();

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
printf("\n\nThe Path is:\n");
mincost(0); // passing 0 because starting vertex
printf("\n\nMinimum cost is %d\n ", cost);

return 0;
}
-----------------------------------------OUTPUT----------------------------------------
Enter the number of villages: 3
Enter the Cost Matrix

Enter Elements of Row: 1

259
Enter Elements of Row: 2
647
Enter Elements of Row: 3
056
The cost list is:
2 5 9
6 4 7
0 5 6

The Path is:

1--->3--->2--->1

Minimum cost is 20

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
3. Write program to implement Dynamic Programming algorithm for the 0/1
Knapsack problem.
#include <stdio.h>
// A utility function that returns maximum of two integers
int max(int a, int b) { return (a > b) ? a : b; }
// Prints the items which are put in a knapsack of capacity W
void printknapSack(int W, int wt[], int val[], int n)
{
int i, w;
int K[n + 1][W + 1];
// Build table K[][] in bottom up manner
for (i = 0; i <= n; i++)
{
for (w = 0; w <= W; w++)
{
if (i == 0 || w == 0)
K[i][w] = 0;
else if (wt[i - 1] <= w)
K[i][w] = max(val[i - 1] +
K[i - 1][w - wt[i - 1]],
K[i - 1][w]);
else
K[i][w] = K[i - 1][w];
}
}
// stores the result of Knapsack
int res = K[n][W];
printf("%d\n", res);
w = W;
for (i = n; i > 0 && res > 0; i--)
{
// either the result comes from the top

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
// (K[i-1][w]) or from (val[i-1] + K[i-1]
// [w-wt[i-1]]) as in Knapsack table. If
// it comes from the latter one/ it means
// the item is included.
if (res == K[i - 1][w])
continue;
else
{
// This item is included.
printf("%d ", wt[i - 1]);

// Since this weight is included its

// value is deducted
res = res - val[i - 1];
w = w - wt[i - 1];
}
}
}
// Driver code
int main()
{
int val[] = {60, 100, 120};
int wt[] = {10, 20, 30};
int W = 50;
int n = sizeof(val) / sizeof(val[0]);
printknapSack(W, wt, val, n);

return 0;
}
-----------------------------------------OUTPUT----------------------------------------
220
30 20

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
4. Write a program to perform Knapsack Problem using Greedy Solution.
#include <stdio.h>
struct Item
{
int value;
int weight;
};
// Function to compare items by value per unit weight
(ratio) in descending order
int compare(const void *a, const void *b)
{
struct Item item1 = *(struct Item *)a;
struct Item item2 = *(struct Item *)b;
double ratio1 = (double)item1.value / item1.weight;
double ratio2 = (double)item2.value / item2.weight;
return ratio2 - ratio1; // Descending order
}
void knapsackGreedy(struct Item arr[], int n, int W)
{
int curWeight = 0; // Current weight in knapsack
double finalValue = 0.0; // Final value in knapsack
int i, remaining;
// Sort items by value per unit weight in descending
order
qsort(arr, n, sizeof(struct Item), compare);
printf("Items selected:\n");
for (i = 0; i < n; i++)
{
if (curWeight + arr[i].weight <= W)
{
curWeight += arr[i].weight;
finalValue += arr[i].value;

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
printf("Item %d (value = %d, weight =
% d)\n ", i + 1, arr[i].value, arr[i].weight);
}
else
{
// Take a fraction of the item if possible
remaining = W - curWeight;
finalValue += arr[i].value *
((double)remaining / arr[i].weight);
break;
}
}
printf("Maximum value in knapsack = %.2f\n",
finalValue);
}
int main()
{
int n, W, i;
printf("Enter number of items: ");
scanf("%d", &n);
printf("Enter knapsack capacity: ");
scanf("%d", &W);
struct Item arr[n];
printf("Enter value and weight for each item:\n");
for (i = 0; i < n; i++)
{
printf("Item %d:\n", i + 1);
scanf("%d %d", &arr[i].value, &arr[i].weight);
}
knapsackGreedy(arr, n, W);
return 0;

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
-----------------------------------------OUTPUT----------------------------------------
Enter number of items: 3
Enter knapsack capacity: 6
Enter value and weight for each item:
Item 1:
10 1
Item 2:
15 2
Item 3:
40 3
Items selected:
Item 1 (value = 40, weight = 3)
Item 2 (value = 10, weight = 1)
Item 3 (value = 15, weight = 2)
Maximum value in knapsack = 65.00

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
5. Write a program to implement a graph's DFS and BFS algorithm.
#include <stdio.h>
int q[20], top = -1, front = -1, rear = -1, a[20][20], vis[20], stack[20];
int delete();
void add(int item);
void bfs(int s, int n);
void dfs(int s, int n);
void push(int item);
int pop();
void main()
{
int n, i, s, ch, j;
char c, dummy;
printf("ENTER THE NUMBER VERTICES ");
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
printf("ENTER 1 IF %d HAS A NODE WITH %d ELSE 0 ", i, j);
scanf("%d", &a[i][j]);
}
}
printf("THE ADJACENCY MATRIX IS\n");
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
printf(" %d", a[i][j]);
}
printf("\n");
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
do
{
for (i = 1; i <= n; i++)
vis[i] = 0;
printf("\nMENU");
printf("\n1.B.F.S");
printf("\n2.D.F.S");
printf("\nENTER YOUR CHOICE");
scanf("%d", &ch);
printf("ENTER THE SOURCE VERTEX :");
scanf("%d", &s);
switch (ch)
{
case 1:
bfs(s, n);
break;
case 2:
dfs(s, n);
break;
}
printf("DO U WANT TO CONTINUE(Y/N) ? ");
scanf("%c", &dummy);
scanf("%c", &c);
} while ((c == 'y') || (c == 'Y'));
}
//**************BFS(breadth-first search) code**************//
void bfs(int s, int n)
{
int p, i;
add(s);
vis[s] = 1;
p = delete ();

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
if (p != 0)
printf(" %d", p);
while (p != 0)
{
for (i = 1; i <= n; i++)
if ((a[p][i] != 0) && (vis[i] == 0))
{
add(i);
vis[i] = 1;
}
p = delete ();
if (p != 0)
printf(" %d ", p);
}
for (i = 1; i <= n; i++)
if (vis[i] == 0)
bfs(i, n);
}
void add(int item)
{
if (rear == 19)
printf("QUEUE FULL");
else
{
if (rear == -1)
{
q[++rear] = item;
front++;
}
else
q[++rear] = item;
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
}
int delete()
{
int k;
if ((front > rear) || (front == -1))
return (0);
else
{
k = q[front++];
return (k);
}
}
//***************DFS (depth-first search) code******************//
void dfs(int s, int n)
{
int i, k;
push(s);
vis[s] = 1;
k = pop();
if (k != 0)
printf(" %d ", k);
while (k != 0)
{
for (i = 1; i <= n; i++)
if ((a[k][i] != 0) && (vis[i] == 0))
{
push(i);
vis[i] = 1;
}
k = pop();
if (k != 0)
printf(" %d ", k);

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
}
for (i = 1; i <= n; i++)
if (vis[i] == 0)
dfs(i, n);
}
void push(int item)
{
if (top == 19)
printf("Stack overflow ");
else
stack[++top] = item;
}
int pop()
{
int k;
if (top == -1)
return (0);
else
{
k = stack[top--];
return (k);
}
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
-----------------------------------------OUTPUT----------------------------------------
ENTER THE NUMBER OF VERTICES 3
ENTER 1 IF 1 HAS A NODE WITH 1 ELSE 0 1
ENTER 1 IF 1 HAS A NODE WITH 2 ELSE 0 1
ENTER 1 IF 1 HAS A NODE WITH 3 ELSE 0 0
ENTER 1 IF 2 HAS A NODE WITH 1 ELSE 0 1
ENTER 1 IF 2 HAS A NODE WITH 2 ELSE 0 0
ENTER 1 IF 2 HAS A NODE WITH 3 ELSE 0 1
ENTER 1 IF 3 HAS A NODE WITH 1 ELSE 0 0
ENTER 1 IF 3 HAS A NODE WITH 2 ELSE 0 1
ENTER 1 IF 3 HAS A NODE WITH 3 ELSE 0 1
THE ADJACENCY MATRIX IS
110
101
011

MENU
1.B.F.S
2.D.F.S
ENTER YOUR CHOICE1
ENTER THE SOURCE VERTEX :5 9
5 1 2 3 DO U WANT TO CONTINUE(Y/N) ?

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
6. Write a program to find minimum and maximum values in an array using
divide and conquer.
#include <stdio.h>
int max, min;
int a[100];
void maxmin(int i, int j)
{
int max1, min1, mid;
if (i == j)
{
max = min = a[i];
}
else
{
if (i == j - 1)
{
if (a[i] < a[j])
{
max = a[j];
min = a[i];
}
else
{
max = a[i];
min = a[j];
}
}
else
{
mid = (i + j) / 2;
maxmin(i, mid);
max1 = max;

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
min1 = min;
maxmin(mid + 1, j);
if (max < max1)
max = max1;
if (min > min1)
min = min1;
}
}
}
int main()
{
int i, num;
printf("\nEnter the total number of numbers : ");
scanf("%d", &num);
printf("Enter the numbers : \n");
for (i = 1; i <= num; i++)
scanf("%d", &a[i]);
max = a[0];
min = a[0];
maxmin(1, num);
printf("Minimum element in an array : %d\n", min);
printf("Maximum element in an array : %d\n", max);
return 0;
}
-----------------------------------------OUTPUT----------------------------------------
Enter the total number of numbers: 3
Enter the numbers:
12 1 4
Minimum element in an array: 1
Maximum element in an array: 12

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
7. Write a test program to implement Divide and Conquer Strategy. Ex: Quick
sort algorithm for sorting list of integers in ascending order.
#include <stdio.h>
void quicksort(int a[25], int f, int l)
{
int i, j, pivot, temp;
if (f < l)
{
pivot = f;
i = f;
j = l;
while (i < j)
{
while (a[i] <= a[pivot] && i < l)
i++;
while (a[j] > a[pivot])
j--;
if (i < j)
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
temp = a[pivot];
a[pivot] = a[j];
a[j] = temp;
quicksort(a, f, j - 1);
quicksort(a, j + 1, l);
}
}
int main()

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
{
int i, n, a[25];
clrscr();
printf("Enter the size of an array\n");
scanf("%d", &n);
printf("Enter %d array elements\n", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
quicksort(a, 0, n - 1);
printf("Sorted elements are...\n");
for (i = 0; i < n; i++)
printf("%3d", a[i]);
return 0;
}
-----------------------------------------OUTPUT----------------------------------------
Enter the size of an array
5
Enter 5 array elements
55 34 90 88 10
Sorted elements are...
10 34 55 88 90

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
8. Write a program to implement Merge sort algorithm for sorting a list of
integers in ascending order.
#include <stdio.h>
void simple_merg(int a[], int low, int mid, int high)
{
int i = low, j = mid + 1, k = low, c[10];
while (i <= mid && j <= high)
{
if (a[i] < a[j])
{
c[k++] = a[i++];
}
else
{
c[k++] = a[j++];
}
}
while (i <= mid)
{
c[k++] = a[i++];
}
while (j <= high)
{
c[k++] = a[j++];
}
for (i = low; i <= high; i++)
{
a[i] = c[i];
}
}
void merg_sort(int a[], int low, int high)
{

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
int mid;
if (low < high)
{
mid = (low + high) / 2;
merg_sort(a, low, mid);
merg_sort(a, mid + 1, high);
simple_merg(a, low, mid, high);
}
}
int main()
{
int a[10], n, i;
printf("Enter the size of an array\n");
scanf("%d", &n);
printf("Enter %d array elements\n", n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
merg_sort(a, 0, n - 1);
printf("The sorted elements are...\n");
for (i = 0; i < n; i++)
printf("%3d", a[i]);
return 0;
}
-----------------------------------------OUTPUT----------------------------------------
Enter the size of an array
5
Enter 5 array elements
23 13 45 88 10
The sorted elements are...
10 13 23 45 88

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
9. Sort a given set of n integer elements using Merge Sort method and compute
its time complexity. Run the program for varied values of n> 5000, and record
the time taken to sort.
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
void mergesort(int, int);
void merge(int, int, int);
int a[20000], temp[20000], n, i, j, k; // n>5000
int main()
{
clock_t start, end;
double t;
printf("Enter the size\n");
scanf("%d", &n);
/*printf("Enter the array of elements\n");
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
*/
for (i = 0; i < n; i++)
a[i] = rand();
start = clock();
mergesort(0, n - 1);
end = clock();
t = ((double)(end - start)) / CLOCKS_PER_SEC;
printf("After sorting\n");
for (i = 0; i < n; i++)
printf("%d\t", temp[i]);
printf("time------>%f", t);
}
void mergesort(int low, int high)
{

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
int mid;
if (low != high)
{
mid = ((low + high) / 2);
mergesort(low, mid);
mergesort(mid + 1, high);
merge(low, mid, high);
}
}
void merge(int low, int mid, int high)
{
i = low;
j = mid + 1;
k = low;
while ((i <= mid) && j <= high)
{
if (a[i] >= a[j])
temp[k++] = a[j++];
else
temp[k++] = a[i++];
}
while (i <= mid)
temp[k++] = a[i++];
while (j <= high)
temp[k++] = a[j++];
for (i = low; i <= high; i++)
a[i] = temp[i];
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
-----------------------------------------OUTPUT----------------------------------------
Enter the size
5000
After sorting
8 21 26 28 28 39 40 41 42 53 53 58 65 71 73 75 101 113 11121 123 138 140 142 142 144 146 148 153 153 159 170 175 189 193 205 225

22235 236 241 248 250 259 288 289 292 300 303 304 318 330 335 337 348 361 40415 423 424 435 441 452 456 462 467 474 475 479 481 484 485 489 491 495 50503 506 521 522 530 530 532 540 542 555 565 592 608 610 613 617 621 628 65656
658 658 661 666 669 675 679 681 684 690 692 698 700 702 704 707 716 72734 742 744 748 750 751 754 778 786 788 792 821 826 832 833 839 841 846 87875 893 893 899 900 905 906 911 912 917 922 930 940 943 958 979 985 989 991009 1012
1012 1014 1017 1018 1023 1025 1028 1048 1052 1052 1054 1056 1064 1071 1071 1084 1085 1088 1105 1127 1131 1135 1146 1150 1157 1181 1187 1200 1201 1205 1206 1219 1226 1229 1238 1259 1264 1267 1278 1280 1282 1293 1320 1325 1331 1334 1338 1340 1344 1355 1360
1363 1364 1381 1386 1401 1405 1411 1411 1416 1421 1430 1436 1441 1443 1454 14 57 1466 1495 1497 1511 1515 1528 1537 1539 1539 1543 1549 1550 1560 1563 1563 1570 1570 1587 1588 1588 1594 1595 1604 1608 1615 1620 1623 1626 1626 1637 1643 1650 1655 1655
1662 1663 1670 1675 1677 1679 1683 1695 1697 1707 1710 1711 1717 1723 1723 1727 1731 1735 1751 1752 1758 1763 1768 1769 1771 1774 1775 1790 1825 1827 1832 1836 1840 1842 1847 1852 1862 1866 1869 1881 1883 1885 1892 1897 1898 1899 1908 1908 1915 1924
1926 1936 1941 1943 1949 1954 1954 1969 1981 1984 1988 1990 1993 1999 2003 20 11 2016 2018 2019 2028 2047 2064 2082 2085 2088 2088 2088 2095 2097 2111 2112 2125 2136 2138 2144 2145 2151 2154 2161 2168 21 73 2183 2186 2187 2206 2208 2220 2222 2223 2232
2237 2244 2257 2257 2258 2264 2270 2286 2290 2303 2306 2307 2317 2317 2324 2327 2330 2334 2340 2343 2352 23 57 2363 2364 2368 2370 2376 2382 2397 2401 2403 2403 2406 2421 2435 2438 2445 2451 2461 2469 2480 2481 2483 2503 2505 2510 2512 2513 2514 2520
2529 2534 2554 2556 2572 2589 2593 2598 2599 2600 2607 2609 2623 2625 2625 2634 2641 2645 2647 2661 2663 2668 2669 2670 2670 2678 2695 2695 2699 2702 2718 2734 2737 2737 2741 2742 2774 2785 2792 2800 2814 2815 2850 2862 2865 2872 2880 2883 2884 28 85 2927
2942 2943 2943 2944 2946 2963 2971 2995 2995 2997 3005 3012 3034 3035 3039 30 53 3059 3065 3079 3093 3093 3102 3134 3145 3154 3154 3164 3169 3181 3184 31 87 3195 3202 3205 3210 3220 3221 3239 3241 3251 3264 3271 3276 3293 3297 3309 3318 3328 3332 3333
3335 3338 3340 3343 3351 3359 3360 3380 3388 3393 3394 3396 3400 3402 3413 3426 3430 3432 3434 3445 3447 3449 3454 3455 3477 3480 3487 3497 3503 3517 3523 3523 3527 3529 3537 3542 3545 3548 3554 3554 3557 3561 3565 3565 3566 3576 3580 3582 3584 3585
3586 3591 3592 3602 3603 3609 3617 3625 3644 3652 3656 3659 3676 3684 3687 36 90 3716 3728 3730 3737 3751 3753 3760 3760 3766 3788 3789 3805 3818 3822 3829 3831 3832 3850 3855 3872 3873 3878 3879 3902 3904 3915 3916 3917 3925 3943 3959 3964 3967 3987
3989 3995 4006 4015 4031 4041 4042 4047 4055 4059 4071 4074 4084 4084 4090 4098 4099 4101 4120 4141 4144 41 57 4169 4182 4186 4198 4202 4208 4213 4229 4231 4235 4287 4287 4291 4313 4313 4319 4324 4327 4343 4345 4346 4360 4360 4364 4380 4381 4414 4415 4422
4429 4434 4449 4460 4464 4472 4474 4489 4493 4508 4510 4536 4565 4566 4575 4580 4583 4586 4591 4592 4593 4596 4611 4623 4629 4632 4639 4640 4640 4641 4651 4664 4667 4675 4678 4680 4681 4686 4693 4693 4698 4712 4715 4718 4719 4720 4734 4745 4747 4750 4750
4755 4757 4769 4795 4798 4802 4806 4827 4833 4841 4852 4854 4858 4860 4860 48 72 4872 4879 4882 4883 4886 4907 4912 4919 4931 4940 4944 4949 4954 4966 4975 4977 4978 4982 4983 4987 4998 5000 5002 5006 5021 5021 5028 5030 50 32 5032 5033 5038 5045 5049
5053 5055 5059 5071 5075 5084 5086 5093 5097 5108 5109 5117 5123 5131 5137 5154 5158 5169 5174 5177 5190 5191 5193 5204 5220 5224 5225 5226 5227 5230 5242 5249 5259 5268 5279 5299 5303 5340 5385 5396 5402 5416 5416 5427 5436 5436 5447 5450 5454 5469
5470 5471 5488 5506 5507 5513 5532 5535 5537 5538 5541 5545 5553 5556 5565 55 65 5566 5584 5589 5589 5601 5602 5602 5610 5628 5629 5638 5646 5651 5651 5651 5662 5676 5677 5686 5692 5695 5699 570 5 5706 5715 5716 5717 5722 5725 5745 5750 5752 5764 5767
5769 5786 5792 5794 5808 5809 5820 5821 5829 5831 5841 5844 5857 5865 5869 5874 5893 5906 5907 5912 5915 5927 5934 5936 5938 5939 5945 5946 5950 5967 5973 5974 5985 5991 5994 5997 6003 6021 6030 6038 6038 6038 6046 6050 6064 6064 6072 6077 6085 6097 6120
6125 6126 6135 6139 6140 6149 6153 6161 6172 6188 6191 6193 6202 6204 6224 6227 6231 6231 6234 6238 6249 6259 6266 6270 6272 6286 6287 6292 6300 6300 6321 6329 6334 6336 6344 6354 6359 6365 6366 6369 6379 6388 6407 6410 6411 6421 6422 64 39 6450 6450 6459
6461 6463 6464 6467 6473 6477 6477 6478 6479 6483 6486 6493 6504 6508 6508 65 11 6533 6538 6538 6540 6540 6541 6558 6559 6562 6576 6582 6595 6599 6602 6608 6617 6618 6636 6637 6640 6645 6646 6648 6652 6654 6693 6698 67 02 6704 6705 6705 6716 6724 6729
6731 6734 6738 6741 6747 6748 6753 6766 6766 6767 6784 6798 6811 6813 6816 6816 6824 6840 6844 6850 6862 6867 6868 6878 6879 6890 6900 6902 6915 6922 6923 6923 6923 6932 6962 6966 6972 6995 7011 7028 7038 7042 7049 7056 7058 7075 7085 7093 7103 7104
7118 7128 7129 7137 7152 7162 7164 7171 7172 7185 7195 7200 7208 7210 7213 72 29 7231 7239 7240 7240 7245 7262 7262 7266 7267 7278 7283 7285 7285 7288 7296 7298 7299 7301 7321 7328 7328 73 49 7355 7357 7358 7372 7373 7375 7376 7391 7406 7419 7432 7441
7441 7448 7450 7452 7462 7469 7470 7479 7487 7491 7492 7498 7511 7514 7516 7518 7523 7523 7531 7534 7540 7545 7547 7551 7572 7578 7585 7586 7590 7591 7592 7603 7604 7605 7611 7616 7619 7619 7627 7636 7640 7665 7666 7670 7672 7679 7679 7688 7711 7717 7720
7721 7727 7740 7741 7746 7768 7783 7793 7809 7811 7813 7815 7833 7846 7864 7879 7882 7886 7887 7900 7905 7912 7915 7918 7926 7949 7950 7952 7954 7958 79 58 7961 7975 7976 7986 7993 7997 8007 8023 8042 8044 8055 8061 8072 8075 8106 8116 8144 8146 8153 8160
8166 8172 8174 8177 8182 8184 8186 8187 8194 8211 8213 8217 8217 8234 8237 82 39 8245 8247 8250 8252 8252 8256 8257 8260 8266 8272 8275 8281 8290 8310 8313 8313 8314 8315 8326 8329 8339 8343 8346 8357 8360 8360 8363 8365 8380 8380 8381 8387 8388 8394
8399 8400 8405 8419 8421 8421 8437 8454 8456 8472 8480 8483 8486 8492 8493 8510 8519 8522 8526 8546 8551 8563 8582 8596 8606 8610 8613 8616 8624 8627 8636 8638 8652 8670 8672 8681 8683 8684 8686 8692 8695 8705 8706 8707 8714 8719 8723 8724 8729 8738
8752 8753 8759 8762 8779 8793 8805 8823 8826 8833 8838 8850 8867 8871 8872 88 80 8890 8891 8896 8909 8917 8922 8925 8928 8932 8934 8935 8938 8942 8956 8964 8965 8968 8971 8976 8978 89 79 8982 8982 8983 8990 8996 9010 9010 9023 9023 9034 9040 9058 9072
9072 9074 9078 9079 9085 9088 9090 9091 9094 9099 9102 9107 9135 9152 9156 9161 9166 91 68 9190 9193 9198 9220 9223 9227 9232 9248 9252 9253 9257 9260 9261 9270 9273 9275 9277 9290 9310 9313 9314 9314 9318 9320 9357 9364 9374 9375 9385 9387 9388 9405 9412
9425 9458 9462 9464 9467 9487 9487 9492 9496 9501 9503 9503 9505 9507 9508 9512 9514 9515 9515 9523 9535 9551 9561 9567 9573 9574 9576 9578 9578 96 01 9616 9625 9646 9647 9658 9658 9676 9694 9707 9714 9722 9729 9734 9741 9758 9762 9768 9781 9789 9789 9793
9793 9815 9818 9832 9834 9846 9850 9853 9858 9860 9876 9894 9905 9905 9916 99 30 9934 9961 9961 9970 9981 9984 9988 9990 10002 10004 10006 10008 10021 10035 10036 10040 10041 10048 10057 10067 10075 10080 10083 10102 1010 3 10106 10112 10116 10130 10133 10134 10142
10142 10144 10146 10168 10176 10178 10189 10193 10195 10199 10202 10202 10208 10238 10252 10258 10268 10270 10273 10285 10285 10291 10293 10312 10313 10322 10324 10350 10353 10357 10365 10378 10380 10382 10382 10383 10389 10390 10393 10396 1 0405 10415 10422 10425 10426 10428
10440 10443 10459 10466 10468 10471 10481 10485 10490 10498 10506 10508 10532 10538 10542 10548 10555 10555 10556 10557 10558 10559 10573 10585 10591 10599 10600 10615 10635 10635 10639 10647 10654 10663 10668 10670 10677 10677 10677 10679 10681 10684 10687 10697 10698 10700
10700 10712 10720 10722 10737 10748 10753 10758 10761 10761 10777 10790 10797 10808 10809 10816 10819 10827 10844 10844 10845 10861 10866 10872 10883 10886 10891 10893 10904 10910 10929 10935 10935 10938 10940 10943 10945 10946 10951 10961 10966 10968 10976 10984 10986 10987
10996 10998 10999 11001 11008 11020 11023 11026 11027 11047 11049 11056 11056 11058 11064 11069 11072 11075 11080 11094 11105 11124 11134 11146 11149 11153 11156 11158 11159 11171 11173 11191 11192 11192 11197 11211 11224 11238 11243 11245 11247 11258 11262 11267 11293 11299
11320 11323 11323 11333 11337 11342 11367 11369 11376 11381 11382 11385 11393 11395 11400 11408 11417 11420 11422 11434 11447 11455 11458 11462 11462 11477 11478 11495 11 503 11504 11511 11514 11520 11521 11531 11538 11544 11567 11585 11593 11599 11600 11622 1163 5 11643 11647
11647 11662 11672 11684 11698 11701 11714 11715 11728 11738 11749 11754 11759 11771 11777 11784 11785 11798 11807 11822 11827 11829 11833 11833 11836 11837 11838 11840 11849 11857 11874 11876 11886 11891 11903 11909 11942 11950 11959 11969 11979 11980 12008 12021 12022 12 033
12036 12042 12043 12044 12052 12053 12054 12060 12073 12074 12074 12076 12078 12079 12083 12087 12097 12105 12118 12121 12126 12129 12136 12137 12157 12158 12158 12164 12170 12181 12 187 12189 12193 12212 12239 12244 12245 12249 12253 12254 12258 12259 12263 12268 12274 1227 4
12279 12287 12289 12290 12292 12294 12295 12306 12316 12317 12319 12322 12351 12356 12361 123 68 12382 12392 12393 12420 12423 12433 12437 12438 12448 12455 12455 12472 12481 12488 12489 12493 12499 12503 12503 12504 12508 12516 12525 12527 12529 12529 12534 12536 12549 12549
12550 12570 12570 12578 12581 12584 12589 12594 12600 12611 12623 12626 12628 12628 12637 12 654 12673 12674 12677 12686 12717 12722 12723 12729 12734 12737 12750 12755 12759 12759 12760 12779 12779 12796 12818 12826 12833 12835 12843 12844 12859 12890 12896 12902 12911 12924
12927 12927 12931 12933 12933 12935 12935 12936 12937 12938 12941 12946 12949 12983 12993 12993 12998 1300 0 13007 13020 13022 13028 13030 13031 13037 13037 13043 13049 13053 13061 13063 13063 13064 13079 13093 13101 13120 13142 13143 13149 13152 13161 13162 13163 13165 13169
13171 13179 13186 13189 13194 13201 13208 13210 13224 13232 13234 13240 13245 13252 13261 13262 13289 13290 13290 13293 13310 13316 13330 13336 13337 13338 13357 13357 13370 13371 13377 13388 13392 13401 13406 13428 13438 13444 13444 13452 13452 13458 13465 13465 13472 13475
13476 13487 13489 13490 13490 13509 13509 13509 13519 13525 13540 13543 13549 13559 13573 13578 13579 13584 13590 13597 13608 13640 13642 13647 13648 13653 13675 13694 13694 13698 13712 13713 13716 13722 13758 13758 13762 13773 13774 13784 13785 13787 13787 13793 13795 13799
13803 13810 13817 13826 13829 13830 13837 13843 13851 13851 13852 13855 13865 13874 13877 13877 13882 13885 13896 13917 13924 13930 13931 13946 13966 13971 13973 13976 13976 13977 13985 13985 13993 13993 13998 14007 14 008 14015 14016 14018 14062 14066 14091 14095 14108 14118
14119 14122 14140 14145 14146 14155 14161 14161 14171 14179 14181 14186 14193 14196 14197 14199 14199 14214 14218 14231 14243 14248 14248 14256 14262 14270 14272 14286 14295 14309 14310 14318 14333 14336 14343 14364 14369 14 376 14381 14387 14398 14398 14413 14423 14428 14428
14439 14443 14460 14462 14464 14469 14474 14481 14485 14486 14489 14504 14507 14512 14518 14522 14523 14541 14550 14552 14578 14589 14590 14600 14604 14606 14609 14615 14624 14625 14629 14631 14633 14640 14651 14663 14676 14688 14 693 14697 14700 14708 14709 14713 14721 14723
14736 14752 14753 14767 14771 14776 14788 14790 14790 14798 14801 14804 14825 14835 14844 14852 14854 14855 14867 14868 14875 14878 14887 1489 0 14893 14893 14895 14899 14902 14902 14907 14924 14932 14945 14955 14957 14962 14962 14964 14984 14989 14990 15000 15005 15006 15012
15020 15022 15023 15024 15026 15032 15038 15055 15072 15075 15084 15100 15117 15127 15137 15 137 15141 15144 15145 15145 15147 15169 15185 15199 15205 15238 15248 15253 15255 15255 15257 15258 15262 15264 15271 15275 15279 15281 15290 15290 152 96 15319 15333 15338 15349 15350
15351 15370 15377 15384 15407 15415 15431 15433 15441 15444 15447 15457 15460 15463 15469 15477 15492 15495 15498 15505 15529 15535 15536 15561 15565 15567 15568 15573 15574 15579 15581 15589 15590 15606 15615 15618 15621 15623 15625 15629 15638 15665 15675 15677 15678 15712
15713 15718 15722 15724 15733 15748 15758 15759 15765 15787 15790 15791 15793 15811 15812 15 813 15814 15821 15826 15834 15835 15869 15871 15881 15890 15891 15896 15944 15945 15947 15948 15955 15966 15969 15987 15993 16002 16016 16036 16040 16060 16061 16070 16074 16080 16081
16085 16085 16088 16090 16096 16097 16100 16105 16117 16118 16125 16128 16129 16139 16141 16142 16158 16191 16193 16202 16208 16211 16215 16216 16224 16225 16226 16251 16256 16259 16278 16279 16280 16282 16290 16292 16296 16303 16320 16321 16334 16336 16337 16339 16339 16343
16345 16360 16366 16367 16371 16398 16405 16406 16413 16423 16430 16439 16439 16446 16453 16 463 16464 16466 16467 16467 16469 16474 16497 16499 16512 16519 16519 16541 16549 16561 16565 16565 16584 16586 16589 16590 16595 16600 16626 16626 16633 16634 16641 16641 16653 16657
16671 16678 16683 16687 16693 16697 16704 16715 16717 16731 16735 16741 16742 16754 16760 16769 16798 16806 16824 16827 16828 16833 16840 16840 16853 16857 16858 16859 16878 16883 16893 16895 16909 16925 16938 16941 16944 16948 16955 16962 16972 16983 16984 16991 17004 17004
17006 17013 17014 17022 17035 17040 17063 17064 17073 17086 17093 17095 17096 17103 17103 17 107 17107 17110 17117 17118 17124 17132 17137 17157 17157 17168 17182 17189 17192 17199 1720 4 17206 17207 17209 17222 17223 17226 17233 17236 17241 17253 17253 17260 17271 17282 17282
17291 17295 17296 17312 17342 17350 17369 17371 17377 17398 17408 17410 17411 17420 17421 17421 17432 17437 17442 17451 17452 17461 17465 17469 17480 17482 17505 17508 17518 17524 17537 17540 17546 17549 17552 17553 17569 17571 17578 17584 17584 17589 17591 17604 17610 17611
17612 17615 17623 17632 17641 17650 17651 17659 17659 17668 17673 17683 17686 17692 17708 17713 17713 17 723 17728 17762 17773 17774 17775 17776 17776 17780 17780 17807 17825 17827 17832 17839 1784 1 17843 17858 17860 17861 17864 17870 17877 17879 17887 17889 17893 17902 17906
17913 17916 17922 17922 17929 17929 17939 17945 17953 17954 17958 17964 17968 17975 17981 17 982 17984 17998 18007 18008 18011 18012 18018 18023 18026 18028 18032 18035 18038 18040 18058 18060 18061 18075 18085 18086 18087 18104 18108 18110 18114 18115 18125 18127 18129 18132
18133 18135 18136 18140 18154 18166 18166 18170 18174 18175 18190 18200 18217 18222 18230 18237 18238 18238 18240 18 245 18258 18259 18259 18271 18277 18281 18283 18283 18298 18300 18318 18319 18330 18333 18335 18337 18345 18352 18364 18366 18373 18382 18392 18396 18397 18413
18423 18434 18443 18448 18455 18456 18456 18457 18467 18470 18479 18490 18493 18503 18509 18 516 18529 18536 18538 18540 18569 18584 18585 18588 18588 18598 18610 18613 18613 18630 18631 18631 18633 18634 18636 18643 18 651 18651 18661 18662 18675 18677 18678 18682 18683 18684
18686 18696 18700 18703 18706 18709 18716 18717 18718 18718 18721 18725 18738 18756 18759 18759 18762 18762 18775 18786 18787 18 792 18805 18805 18819 18823 18828 18829 18840 18842 18846 18848 18864 18866 18875 18882 1889 6 18902 18908 18913 18913 18915 18935 18938 18939 18958
18965 18990 18990 19002 19008 19019 19022 19029 19037 19044 19047 19050 19066 19067 19072 19 090 19093 19094 19095 19095 19097 19103 19104 19105 19109 19135 19149 19154 19156 19160 19161 19169 19172 19176 19178 19187 19195 19198 19 199 19203 19252 19264 19269 19271 19278 19281
19285 19285 19298 19312 19314 19353 19357 19359 19368 19369 19375 19381 19396 19397 19402 19405 19406 19410 19413 19420 19426 19435 19438 19 443 19447 19463 19468 19472 19473 19485 19489 19490 19497 19522 19531 19533 19539 19552 1955 5 19557 19558 19567 19569 19589 19593 19601
19611 19623 19629 19631 19645 19649 19662 19664 19668 19677 19685 19690 19692 19695 19695 19 711 19714 19718 19724 19735 19737 19750 19751 19752 19761 19770 19771 19779 19785 19790 19793 19796 19801 19801 19808 19810 19812 19814 19815 19842 1 9851 19854 19854 19855 19861 19864
19866 19877 19882 19885 19891 19895 19897 19904 19911 19912 19914 19917 19919 19923 19926 19932 19948 19949 19954 19964 19974 19975 19976 19978 19982 199 91 19997 20024 20027 20037 20040 20053 20055 20061 20065 20070 20072 20072 20073 20078 20083 20083 20084 20122 20123 20124
20128 20130 20134 20135 20135 20136 20142 20149 20159 20169 20169 20170 20173 20175 20178 20 183 20183 20183 20189 20189 20193 20215 20217 20222 20229 20237 20253 20259 20259 20267 20272 20274 20278 20279 20280 20289 20307 20308 20311 20315 20326 20328 20 328 20333 20337 20340
20353 20355 20356 20363 20373 20381 20383 20386 20403 20415 20415 20416 20416 20418 20424 20426 20448 20450 20454 20472 20474 20476 20481 20482 20485 20489 20493 20502 20514 20523 20528 20537 20538 20540 20542 20556 20556 20577 20580 20580 20594 20595 20600 20601 20608 20609
20615 20620 20626 20633 20640 20643 20645 20648 20649 20652 20654 20663 20664 20666 20666 20 666 20667 20671 20675 20686 20695 20703 20710 20710 20718 20722 20736 20736 20741 20747 20769 20778 20783 20785 20798 20799 20807 20825 20829 20830 20851 20851 20855 20877 20877 20888
20889 20899 20913 20920 20945 20949 20967 20967 20968 20972 20979 20990 20997 21001 21003 21005 21006 21011 21015 21016 21025 21028 21047 21051 21060 21074 21078 21080 21080 21 083 21085 21086 21090 21098 21098 21100 21108 21109 21113 21119 21132 21136 21138 21143 21153 21154
21184 21184 21188 21196 21219 21221 21221 21228 21229 21244 21265 21267 21276 21284 21286 21292 21293 21295 21300 21302 21313 21318 21321 21323 21337 21346 21358 21363 21364 21376 21388 21396 21409 21411 21411 21416 21419 21425 21430 21447 21457 21457 21459 21465 21476 21476
21478 21479 21480 21487 21497 21501 21505 21520 21528 21538 21543 21545 21547 21547 21548 21 555 21561 21562 21575 21577 21578 21595 21604 21617 21617 21624 21630 21634 21641 21659 21665 216 83 21691 21693 21694 21702 21705 21710 21718 21724 21724 21726 21735 21754 21759 21763
21766 21768 21778 21781 21787 21794 21817 21839 21840 21856 21860 21862 21867 21873 21881 21892 21895 21901 21907 21909 21911 21920 21926 21945 21945 21948 21954 21962 21963 21968 21970 21974 21979 21979 21982 21984 21991 22005 22012 22015 22015 22018 22033 22037 22044 22045
22056 22086 22104 22106 22129 22139 22142 22148 22161 22162 22171 22186 22187 22190 22194 22 197 22197 22199 22214 22225 22233 22241 22276 22279 22284 22290 22294 22296 22307 22312 22313 22336 22342 2234 8 22355 22361 22363 22386 22399 22405 22409 22413 22421 22428 22431 22466
22471 22482 22483 22492 22494 22496 22501 22511 22512 22514 22525 22530 22532 22549 22549 22566 22570 22578 22586 22593 22593 22597 22619 22619 22630 22632 22638 22640 22646 22648 22658 22659 22663 22667 22 668 22675 22678 22688 22701 22704 22708 22716 22725 22740 22741 22750
22758 22769 22777 22795 22795 22798 22813 22816 22830 22832 22844 22848 22850 22850 22858 22 860 22861 22867 22869 22885 22885 22888 22892 22897 22902 22908 22912 22912 22913 22925 22929 22951 22955 22972 22972 22974 22974 22988 22999 23000 23015 23016 23017 23024 23035 23041
23043 23061 23061 23072 23073 23088 23092 23101 23105 23105 23112 23115 23116 23144 23146 23147 23152 23152 23154 23158 23165 23 168 23175 23179 23183 23186 23188 23194 23195 23196 23199 23202 23216 23224 23231 23234 2324 3 23245 23245 23256 23258 23267 23271 23277 23281 23283
23292 23296 23305 23318 23327 23332 23335 23342 23388 23390 23391 23392 23396 23400 23407 23 425 23439 23445 23448 23455 23461 23481 23483 23487 23492 23495 23501 23504 23525 23532 23542 23552 23556 23569 23572 23577 23588 23589 23622 23623 23639 23646 23650 23655 23656 23661
23669 23675 23681 23683 23684 23692 23694 23699 23700 23717 23729 23743 23754 23757 23762 23775 23775 23779 23805 23811 23817 23826 23831 23838 23840 23844 23847 23849 23850 23851 23855 23856 23859 23865 23869 23888 23893 23901 2391 7 23936 23941 23941 23953 23955 23960 23967
23971 23977 23978 23986 23987 23990 23992 23994 24007 24007 24008 24016 24021 24028 24028 24033 24041 24050 24061 24065 24069 24075 24081 24084 24087 24099 24114 24115 24117 24118 24120 24122 24125 24129 24146 24147 24155 24160 24168 24169 24176 24179 24182 24196 24196 24199
24208 24209 24216 24221 24223 24227 24229 24230 24237 24241 24245 24254 24271 24272 24272 24277 24290 24300 24307 24308 24312 24314 24320 24326 24346 24348 24350 24353 24353 24355 24365 24370 24372 24389 24390 24390 24393 24395 24399 24408 24423 24429 24441 24450 24455 24459
24464 24464 24472 24473 24474 24474 24484 24484 24488 24512 24514 24515 24520 24524 24526 24541 24546 24547 24555 24557 24565 24567 24588 24591 24593 24593 24596 24599 24604 24616 24618 24618 24620 24626 24637 24642 24643 24648 24668 24671 24676 24684 24696 24696 24705 24710
24722 24743 24745 24750 24766 24767 24769 24773 24773 24774 24778 24779 24791 24798 24808 24815 24816 24828 24828 24828 24833 24834 24844 24855 24865 24870 24898 24 901 24917 24919 24925 24937 24942 24946 24948 24956 24958 24959 24961 24962 24970 24979 24979 24998 25011 25012
25013 25020 25023 25027 25043 25050 25052 25058 25072 25079 25087 25089 25095 25107 25128 25128 25134 25141 25149 25162 25167 25184 25190 25191 25197 25200 25205 25215 25230 25236 25249 25253 25264 25264 25269 25269 25293 25296 25302 25313 25314 25316 25318 25328 25329 25333
25345 25347 25367 25385 25386 25391 25395 25402 25403 25411 25423 25428 25429 25436 25442 25449 25452 25452 25456 25472 25476 25484 25502 25508 25518 25519 25524 25542 25547 25547 25547 25561 25563 25584 25587 25598 25603 25605 25608 25616 25619 25620 25624 25627 2562 9 25631
25631 25633 25656 25667 25668 25678 25679 25680 25686 25697 25705 25706 25710 25713 25721 25 722 25734 25739 25739 25759 25760 25770 25776 25783 25790 25790 25791 25808 25813 25822 25 824 25824 25828 25834 25836 25841 25846 25858 25867 25874 25880 25893 25897 25898 25903 25917
25923 25928 25951 25960 25967 25981 25988 25990 25996 26018 26021 26031 26034 26040 26048 26 052 26053 26058 26063 26067 26068 26072 26074 26099 26101 26113 26115 26122 26124 26126 26129 26 133 26134 26152 26153 26154 26160 26173 26177 26182 26200 26203 26206 26222 26224 26248
26253 26255 26260 26260 26260 26264 26268 26281 26291 26292 26299 26302 26303 26308 26312 26321 263 33 26358 26362 26363 26363 26364 26385 26385 26386 26412 26418 26423 26424 26428 26431 26434 26439 26443 26444 26463 26467 26477 26484 26488 26489 26500 26504 26517 26518 26528
26534 26539 26555 26569 26576 26578 26584 26588 26610 26610 26611 26615 26624 26630 26632 26633 26641 26653 26658 26667 26679 26685 26701 26705 26720 26727 26737 26740 26746 26758 26777 26781 26787 26790 26792 26792 26793 26798 26803 26804 26806 26807 26809 26811 26814 26814
26816 26819 26821 26835 26841 26847 26850 26857 26859 26865 26867 26869 26880 26886 26890 26897 26900 26909 26919 26919 26924 26925 26928 26943 26946 26946 26947 26948 26949 26962 26969 26979 26984 27005 27007 27008 27032 27037 27038 27038 27043 27053 27065 27065 27067 27080
27085 27088 27089 27091 27098 27109 27123 27124 27137 27152 27157 27168 27171 27182 27189 27196 27200 27216 27219 27224 27251 27252 27256 27264 27273 27283 27296 27296 27297 27311 27330 27338 27348 27350 27352 27358 27362 27368 27370 27372 27384 27393 27395 27415 27416 27432
27432 27437 27440 27441 27442 27446 27465 27478 27479 27489 27504 27505 27506 27529 27530 27531 27553 27577 27577 27577 27579 27580 27587 27587 27587 27590 27593 27594 27595 27602 27606 27607 27611 27616 27621 27624 27626 27633 27644 27649 27649 27651 27663 27666 27669 27671
27681 27689 27692 27700 27705 27714 27726 27732 27734 27753 27753 27754 27756 27759 27760 27792 27799 27804 27809 27813 27830 27834 27837 27841 27842 27844 27870 27873 27892 27892 27892 27896 27909 27918 27918 27936 27936 27 938 27956 27967 27982 27988 27999 28009 28019 28022
28023 28026 28027 28029 28042 28047 28049 28053 28070 28074 28074 28074 28074 28082 28082 28094 28099 28102 28112 28118 28119 28128 281 30 28134 28135 28145 28148 28149 28162 28164 28168 28180 28182 28211 28213 28223 28223 28233 28240 28245 28246 28252 28253 28255 28262 28274
28286 28287 28289 28290 28290 28295 28296 28297 28299 28313 28315 28315 28317 28318 28318 28 321 28323 28325 28343 28350 28356 28366 28368 28382 28392 28396 28400 28402 28406 28410 28411 28422 28423 28428 28433 28440 28442 28458 28464 28 469 28470 28476 28486 28487 28488 28489
28498 28499 28503 28504 28505 28510 28520 28522 28522 28532 28564 28569 28570 28580 28583 28583 28592 28596 28607 28614 28617 28621 28630 28633 2864 1 28642 28650 28652 28664 28666 28680 28681 28685 28689 28692 28703 28703 28704 28712 28733 28745 28747 28761 28765 28768 28773
28781 28782 28786 28791 28801 28804 28822 28834 28838 28854 28856 28862 28869 28870 28878 28 888 28888 28892 28942 28956 28960 28962 28963 28970 28978 28981 28995 29001 29007 29011 29011 29022 29033 29065 29074 29082 29087 29091 29102 29105 29126 29130 29130 29141 29146 29151
29152 29153 29156 29168 29170 29171 29173 29174 29174 29182 29200 29213 29213 29218 29221 29235 29236 29249 29250 29253 29256 29264 29271 29271 29288 29292 29292 29301 29309 29313 29314 29331 29334 29334 29337 29350 29352 29356 29358 29361 29361 29372 29 383 29400 29421 29421
29426 29427 29444 29445 29447 29448 29458 29465 29472 29478 29486 29492 29503 29510 29515 29 527 29541 29554 29556 29556 29560 29561 29562 29565 29577 29591 29608 29613 29614 29617 29617 29621 29643 29656 29657 29658 29669 29681 29681 29704 29731 29733 29734 29744 29749 29756
29761 29763 29768 29768 29777 29789 29790 29795 29812 29815 29832 29833 29849 29855 29855 29857 29859 29866 29869 29869 29873 29876 29881 29891 29897 29901 29909 29910 29916 29929 29935 29942 29942 29947 29954 29956 29959 29962 29972 29975 29977 29979 29986 29993 29 996 30003
30032 30037 30038 30041 30048 30049 30062 30066 30080 30093 30096 30104 30106 30109 30114 30 119 30134 30137 30145 30169 30175 30180 30188 30189 30191 30195 30211 30212 30221 30227 30227 30231 30238 30245 30259 30260 30270 30271 30300 30301 30303 30308 30323 30333 30335 30 336
30338 30345 30350 30397 30406 30412 30422 30424 30432 30435 30466 30470 30470 30499 30502 30510 30511 30519 30523 30524 30527 30538 30548 30556 30568 30574 30581 30591 30614 30623 30624 30630 30643 30648 30654 30664 30665 30674 30693 30695 30712 30714 30721 30731 30732 30742
30771 30774 30775 30783 30786 30787 30792 30792 30806 30807 30811 30814 30816 30833 30833 30836 30836 30837 30838 30843 30858 30862 30875 30876 30877 30883 30885 30900 30906 30910 30931 30932 30935 30946 30947 30953 30971 30971 30974 30974 30977 31000 31001 31003 31004 31015
31020 31033 31034 31036 31056 31060 31063 31065 31066 31068 31071 31088 31098 31101 31102 31 107 31111 31111 31115 31122 31149 31151 31155 31159 31163 31165 31172 31175 31180 31185 31196 31202 31203 31226 31240 31244 31245 31250 31256 31260 31269 31270 31274 31276 31283 31286
31302 31310 31310 31311 31313 31314 31316 31322 31329 31339 31347 31348 31351 31357 31361 31371 31376 31413 31417 31418 31426 31426 31441 31447 31450 31453 31461 31461 31463 31467 31476 31478 31490 31493 31 495 31496 31497 31502 31505 31506 31522 31531 31539 31540 31547 31550
31552 31556 31561 31577 31579 31585 31591 31597 31597 31601 31620 31622 31626 31627 31635 31 641 31641 31647 31654 31665 31673 31676 31687 31690 31708 31717 31723 31741 31744 31754 31754 31758 31762 31768 31783 31785 31805 31810 31812 31818 31864 31896 31901 31907 31913 31918
31920 31920 31923 31928 31934 31947 31981 31982 31988 31993 31998 31999 32000 32018 32019 32020 32029 32036 32046 32050 32 053 32060 32072 32074 32075 32080 32091 32094 32097 32106 32119 32125 32143 32145 32145 3216 8 32170 32176 32179 32179 32182 32190 32195 32196 32200 32203
32209 32209 32226 32240 32255 32257 32261 32270 32271 32301 32331 32356 32371 32372 32389 32 389 32391 32404 32405 32425 32439 32444 32468 32469 32471 32471 32482 32488 32498 32499 32501 32503 32506 32517 32521 32525 32528 32 544 32557 32570 32584 32588 32591 32604 32607 32609

32611 32612 32618 32621 32621 32627 32628 32629 32637 32651 32652 32657 32662 32668 32671 32676 32677 32678 32683 32685 32686 32701 32702 32702 32702 32703 32707 32715 32718 32719 32726 32729 32736 32745 32756 32757 32764 32765
time------>0.000000

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
10. Sort a given set of n integer elements using Quick Sort method and compute
its time complexity. Run the program for varied values of n> 5000 and record
the time taken to sort.
#include <stdio.h>
#include <time.h>

// Declare partition function before quicksort

int partition(int arr[], int low, int high);

void swap(int *a, int *b);
void quickSort(int arr[], int low, int high)
{
int pivot;
if (low < high)
{
pivot = partition(arr, low, high);
// Recursively sort elements on the left of pivot and elements on the right of pivot
quickSort(arr, low, pivot - 1);
quickSort(arr, pivot + 1, high);
}
}
int partition(int arr[], int low, int high)
{
int pivot = arr[high];
int i = (low - 1);
int j;
for (j = low; j <= high - 1; j++)
{
if (arr[j] <= pivot)
{
i++;
// swap function needs to be declared or defined before being used.

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
void swap(int *a, int *b)
{
int temp;
temp = *a;
*a = *b;
*b = temp;
}
void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
{
printf("%d\t", arr[i]);
}
printf("\n");
}
int main()
{
int n, i;
printf("Enter the number of elements: ");
scanf("%d", &n);

// Declare the array after reading the value of n

int arr[n];
/*printf("Enter %d integers, (Let no be > 5000): \n", n);
for (i = 0; i < n;i++){

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
scanf("%d", &arr[i]);
}*/
for (i = 0; i < n; i++)
arr[i] = rand();
clock_t start, end;
start = clock();
quickSort(arr, 0, n - 1);
end = clock();
double time_taken = ((double)(end - start)) / CLOCKS_PER_SEC;
printf("Sorted array: \n");
printArray(arr, n);
printf("Time taken to sort: %f second\n", time_taken);
return 0;
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
-----------------------------------------OUTPUT----------------------------------------
Enter the number of elements: 5000
Sorted array:
8 21 26 28 28 39 40 41 42 53 53 58 65 71 73 75 101 113 11121 123 138 140 14 2 142 144 146 148 153 153 159 170 175 189 193 205 225 22235 236 241

248 250 259 288 289 292 300 303 304 318 330 335 337 348 361 40415 423 424 435 441 452 456 462 467 474 475 479 481 484 485 489 491 495 50503 506 521 522 530 530 532 540 542 555 565 592 608 610 613 617 621 628 65656 658 658 661
666 669 675 679 681 684 690 692 698 700 702 704 707 716 72734 742 744 748 750 751 754 778 786 788 792 821 826 832 833 839 841 846 87875 893 893 899 900 905 90 6 911 912 917 922 930 940 943 958 979 985 989 991009 1012 1012 1014 10 17
1018 1023 1025 1028 1048 1052 1052 1054 1056 1064 1071 1071 1084 1085 1088 1105 1127 1131 1135 1146 1150 1157 1181 1187 1200 1201 1205 1206 1219 1226 1229 1238 1259 1264 1267 1278 1280 1282 1293 1320 1325 1331 1334 1338 1340 1344 13 55 1360 1363 1364
1381 1386 1401 1405 1411 1411 1416 1421 1430 1436 1441 1443 1454 1457 1466 1495 1497 1511 1515 1528 1537 1539 1539 1543 1549 1550 1560 1563 1563 1570 1570 1587 1588 1588 1594 1595 1604 1608 1615 1620 1623 1626 1626 16 37 1643 1650 1655 1655 1662 1663 1670
1675 1677 1679 1683 1695 1697 1707 1710 1711 1717 1723 1723 1727 1731 1735 1751 1752 1758 1763 1768 1769 1771 1774 1775 1790 1825 1827 1832 1836 1840 1842 1847 1852 1862 1866 1869 1881 1883 1885 1892 1897 1898 1899 1908 1908 1915 1924 1926 1936 1941
1943 1949 1954 1954 1969 1981 1984 1988 1990 1993 1999 2003 2011 2016 2018 20 19 2028 2047 2064 2082 2085 2088 2088 2088 2095 2097 2111 2112 2125 2136 2138 2144 2145 2151 2154 2161 2168 2173 2183 2186 2187 2206 2208 2220 2222 2223 2232 2237 2244 2257
2257 2258 2264 2270 2286 2290 2303 2306 2307 2317 2317 2324 2327 2330 2334 2340 2343 23 52 2357 2363 2364 2368 2370 2376 2382 2397 2401 2403 2403 2406 2421 2435 2438 2445 2451 2461 2469 2480 2481 2483 2503 2505 2510 2512 2513 2514 2520 2529 253 4 2554
2556 2572 2589 2593 2598 2599 2600 2607 2609 2623 2625 2625 2634 2641 2645 2647 2661 2663 2668 2669 2670 2670 2678 2695 2695 2699 2702 2718 2734 2737 2737 2741 2742 2774 2785 2792 2800 2814 2815 2850 2862 2865 2872 2880 2883 2884 2885 2927 2942 2943 2943
2944 2946 2963 2971 2995 2995 2997 3005 3012 3034 3035 3039 3053 3059 3065 3079 3093 3093 3102 3134 3145 3154 3154 3164 3169 3181 3184 3187 3195 3202 3205 3210 3220 3221 3239 3241 3251 3264 3271 3276 3293 3297 3309 3318 3328 3332 3333 3335 3338 3340 3343
3351 3359 3360 3380 3388 3393 3394 3396 3400 3402 3413 3426 3430 3432 3434 3445 3447 3449 3454 3455 3477 3480 34 87 3497 3503 3517 3523 3523 3527 3529 3537 3542 3545 3548 3554 3554 3557 3561 3565 3565 3566 3576 3580 3582 3584 3585 3586 3591 3592 3602
3603 3609 3617 3625 3644 3652 3656 3659 3676 3684 3687 3690 3716 3728 3730 37 37 3751 3753 3760 3760 3766 3788 3789 3805 3818 3822 3829 3831 3832 3850 3855 3872 3873 3878 3879 3902 3904 3915 3916 3917 3925 3943 3959 3964 3967 3987 3989 3995 4006 4015
4031 4041 4042 4047 4055 4059 4071 4074 4084 4084 4090 4098 4099 4101 4120 4141 4144 4157 4169 4182 4186 4198 4202 4208 4213 4229 4231 4235 4287 4287 4291 4313 4313 4319 4324 4327 4343 4345 4346 4360 4360 4364 4380 4381 4414 4415 4422 44 29 4434 4449
4460 4464 4472 4474 4489 4493 4508 4510 4536 4565 4566 4575 4580 4583 4586 4591 4592 4593 4596 4611 4623 4629 4632 4639 4640 4640 4641 4651 4664 46 67 4675 4678 4680 4681 4686 4693 4693 4698 4712 4715 4718 4719 4720 4734 4745 4747 4750 4750 4755 4757 4769
4795 4798 4802 4806 4827 4833 4841 4852 4854 4858 4860 4860 4872 4872 4879 4882 4883 4886 4907 4912 4919 4931 4940 4944 4949 4954 4966 4975 4977 4978 4982 4983 4987 4998 5000 5002 5006 5021 5021 5028 50 30 5032 5032 5033 5038 5045 5049 5053 5055 5059 5071
5075 5084 5086 5093 5097 5108 5109 5117 5123 5131 5137 5154 5158 5169 5174 5177 5190 5191 5193 5204 5220 5224 5225 5226 5227 5230 5242 5249 5259 5268 5279 5299 5303 5340 5385 5396 5402 5416 5416 5427 5436 5436 5447 5450 5454 5469 5470 5471 5488 5506
5507 5513 5532 5535 5537 5538 5541 5545 5553 5556 5565 5565 5566 5584 5589 55 89 5601 5602 5602 5610 5628 5629 5638 5646 5651 5651 5651 5662 5676 5677 5686 5692 5695 569 9 5705 5706 5715 5716 5717 5722 5725 5745 5750 5752 5764 5767 5769 5786 5792 5794
5808 5809 5820 5821 5829 5831 5841 5844 5857 5865 5869 5874 5893 5906 5907 59 12 5915 5927 5934 5936 5938 5939 5945 5946 5950 5967 5973 5974 5985 5991 5994 5997 6003 6021 6030 6038 6038 6038 6046 6050 6064 6064 6072 6077 6085 6097 6120 6125 6126 6135
6139 6140 6149 6153 6161 6172 6188 6191 6193 6202 6204 6224 6227 6231 6231 6234 6238 6249 6259 6266 6270 6272 6286 6287 6292 6300 6300 6321 6329 6334 6336 6344 6354 6359 6365 6366 6369 6379 6388 6407 6410 6411 6421 64 22 6439 6450 6450 6459 6461 6463 6464
6467 6473 6477 6477 6478 6479 6483 6486 6493 6504 6508 6508 6511 6533 6538 6538 6540 6540 6541 6558 6559 6562 6576 6582 6595 6599 6602 6608 6617 6618 6636 6637 6640 6645 6646 6648 6652 6654 6693 66 98 6702 6704 6705 6705 6716 6724 6729 6731 6734 6738 6741
6747 6748 6753 6766 6766 6767 6784 6798 6811 6813 6816 6816 6824 6840 6844 6850 6862 6867 6868 6878 6879 6890 6900 6902 6915 6922 6923 6923 6923 6932 6962 6966 6972 6995 7011 70 28 7038 7042 7049 7056 7058 7075 7085 7093 7103 7104 7118 7128 7129 7137
7152 7162 7164 7171 7172 7185 7195 7200 7208 7210 7213 7229 7231 7239 7240 72 40 7245 7262 7262 7266 7267 7278 7283 7285 7285 7288 7296 7298 7299 7301 7321 7328 73 28 7349 7355 7357 7358 7372 7373 7375 7376 7391 7406 7419 7432 7441 7441 7448 7450 7452
7462 7469 7470 7479 7487 7491 7492 7498 7511 7514 7516 7518 7523 7523 7531 75 34 7540 7545 7547 7551 7572 7578 7585 7586 7590 7591 7592 7603 7604 7605 7611 7616 7619 7619 7627 7636 7640 7665 7666 7670 7672 7679 7679 7688 7711 7717 7720 7721 7727 7740
7741 7746 7768 7783 7793 7809 7811 7813 7815 7833 7846 7864 7879 7882 7886 7887 7900 7905 7912 7915 7918 7926 7949 7950 7952 7954 7958 7958 7961 7975 7976 7986 7993 7997 8007 8023 8042 8044 8055 8061 8072 8075 8106 8116 8144 8146 8153 8160 8166 8172 8174
8177 8182 8184 8186 8187 8194 8211 8213 8217 8217 8234 8237 8239 8245 8247 8250 8252 8252 8256 8257 8260 8266 8272 8275 8281 8290 8310 8313 8313 8314 8315 8326 8329 8339 8343 8346 8357 8360 8360 8363 8365 8380 8380 8381 8387 8388 8394 8399 8400 8405 8419
8421 8421 8437 8454 8456 8472 8480 8483 8486 8492 8493 8510 8519 8522 8526 8546 8551 8563 8582 8596 8606 8610 8613 8616 8624 8627 8636 8638 8652 8670 8672 8681 8683 8684 86 86 8692 8695 8705 8706 8707 8714 8719 8723 8724 8729 8738 8752 8753 8759 8762
8779 8793 8805 8823 8826 8833 8838 8850 8867 8871 8872 8880 8890 8891 8896 89 09 8917 8922 8925 8928 8932 8934 8935 8938 8942 8956 8964 8965 8968 8971 8976 89 78 8979 8982 8982 8983 8990 8996 9010 9010 9023 9023 9034 9040 9058 9072 9072 9074 9078 9079
9085 9088 9090 9091 9094 9099 9102 9107 9135 9152 9156 9161 9166 9168 9190 91 93 9198 9220 9223 9227 9232 9248 9252 9253 9257 9260 9261 9270 9273 9275 9277 9290 9310 9313 9314 9314 9318 9320 9357 9364 9374 9375 9385 9387 9388 9405 9412 9425 9458 9462
9464 9467 9487 9487 9492 9496 9501 9503 9503 9505 9507 9508 9512 9514 9515 9515 9523 9535 9551 9561 9567 9573 9574 9576 9578 95 78 9601 9616 9625 9646 9647 9658 9658 9676 9694 9707 9714 9722 9729 9734 9741 9758 9762 9768 9781 9789 9789 9793 9793 9815 9818
9832 9834 9846 9850 9853 9858 9860 9876 9894 9905 9905 9916 9930 9934 9961 9961 9970 9981 9984 9988 9990 10002 10004 10006 10008 10021 10035 10036 10040 10041 10048 10057 10067 10075 10080 10083 1010 2 10103 10106 10112 10116 10130 10133 10134 10142 10142 10144 10146
10168 10176 10178 10189 10193 10195 10199 10202 10202 10208 10238 10252 10258 10268 10270 10273 10285 10285 10291 10293 10 312 10313 10322 10324 10350 10353 10357 10365 10378 10380 10382 10382 10383 10389 10390 1039 3 10396 10405 10415 10422 10425 10426 10428 10440 10443 10459
10466 10468 10471 10481 10485 10490 10498 10506 10508 10532 10538 10542 10548 10555 10555 10556 10557 10558 10559 10573 10585 10591 10599 10600 10615 10635 10635 10639 10647 10654 10663 10668 10670 10677 10677 10677 10679 10681 10684 10687 10697 10698 10700 10700 10712 10720
10722 10737 10748 10753 10758 10761 10761 10777 10790 10797 10808 10809 10816 10819 10827 10844 10844 10845 10861 10866 10872 10883 10 886 10891 10893 10904 10910 10929 10935 10935 10938 10940 10943 10945 10946 10951 10961 10966 10968 10976 10984 10986 10987 10996 10998 10999
11001 11008 11020 11023 11026 11027 11047 11049 11056 11056 11058 11064 11069 11072 11075 11 080 11094 11105 11124 11134 11146 11149 11153 11156 11158 11159 11171 11173 11191 11192 11192 11197 11211 11224 11238 11243 11245 11247 11258 11262 11267 11293 11299 11320 11323 11323
11333 11337 11342 11367 11369 11376 11381 11382 11385 11393 11395 11400 11408 11417 11420 11422 11434 11447 11455 11458 11462 11462 11477 11478 11 495 11503 11504 11511 11514 11520 11521 11531 11538 11544 11567 11585 11593 11599 11600 11622 11635 11643 11647 11647 11662 11672
11684 11698 11701 11714 11715 11728 11738 11749 11754 11759 11771 11777 11784 11785 11798 11 807 11822 11827 11829 11833 11833 11836 11837 11838 11840 11849 11857 11874 11876 11886 11891 11903 11909 11942 11950 11959 11969 11979 11980 12008 12021 12 022 12033 12036 12042 12043
12044 12052 12053 12054 12060 12073 12074 12074 12076 12078 12079 12083 12087 12097 12105 12118 12121 12126 12129 12136 12137 12157 12158 12158 12164 12170 12 181 12187 12189 12193 12212 12239 12244 12245 12249 12253 12254 12258 12259 12263 12268 1227 4 12274 12279 12287 12289
12290 12292 12294 12295 12306 12316 12317 12319 12322 12351 12356 12361 12368 12382 12392 12 393 12420 12423 12433 12437 12438 12448 12455 12455 12472 12481 12488 12489 12493 12499 12503 12503 12504 12508 12516 12525 12527 12529 12529 12534 12536 12549 12549 12550 12570 12570
12578 12581 12584 12589 12594 12600 12611 12623 12626 12628 12628 12637 12654 12673 12674 12677 12686 12717 12722 12723 12729 12734 12737 12750 12755 12759 12759 12760 12779 12779 12796 12818 12826 12833 12835 12843 12844 12859 12890 12896 12902 12911 12924 1292 7 12927 12931
12933 12933 12935 12935 12936 12937 12938 12941 12946 12949 12983 12993 12993 12998 13000 13 007 13020 13022 13028 13030 13031 13037 13037 13043 13049 13053 13061 13063 13063 1306 4 13079 13093 13101 13120 13142 13143 13149 13152 13161 13162 13163 13165 13169 13171 13179 13186
13189 13194 13201 13208 13210 13224 13232 13234 13240 13245 13252 13261 13262 13289 13290 13290 13293 13310 13316 13330 13336 13337 13338 13357 13357 13370 13371 13377 13388 13392 13401 13406 13428 13438 13444 13444 13452 13452 13458 13465 13465 13472 13475 13476 13487 13489
13490 13490 13509 13509 13509 13519 13525 13540 13543 13549 13559 13573 13578 13579 13584 13590 13597 13608 13640 13642 13647 13648 13653 13675 13694 13694 13698 13712 13713 13716 13722 13 758 13758 13762 13773 13774 13784 13785 13787 13787 13793 13795 13799 13803 13810 13817
13826 13829 13830 13837 13843 13851 13851 13852 13855 13865 13874 13877 13877 13882 13885 13 896 13917 13924 13930 13931 13946 13966 13971 13973 13976 13976 13977 13985 13985 13993 13993 13998 14 007 14008 14015 14016 14018 14062 14066 14091 14095 14108 14118 14119 14122 14140
14145 14146 14155 14161 14161 14171 14179 14181 14186 14193 14196 14197 14199 14199 14214 14218 14231 14243 14248 14248 14256 14262 14270 14272 14286 14295 14309 14310 14318 14333 14336 14343 14364 14 369 14376 14381 14387 14398 14398 14413 14423 14428 14428 14439 14443 14460
14462 14464 14469 14474 14481 14485 14486 14489 14504 14507 14512 14518 14522 14523 14541 14 550 14552 14578 14589 14590 14600 14604 14606 14609 14615 14624 14625 14629 14631 14633 14640 14651 14663 14676 14 688 14693 14697 14700 14708 14709 14713 14721 14723 14736 14752 14753
14767 14771 14776 14788 14790 14790 14798 14801 14804 14825 14835 14844 14852 14854 14855 14867 14868 14875 14878 1488 7 14890 14893 14893 14895 14899 14902 14902 14907 14924 14932 14945 14955 14957 14962 14962 1 4964 14984 14989 14990 15000 15005 15006 15012 15020 15022 15023
15024 15026 15032 15038 15055 15072 15075 15084 15100 15117 15127 15137 15137 15141 15144 15 145 15145 15147 15169 15185 15199 15205 15238 15248 15253 15255 15255 15257 15258 15262 15264 15271 15275 15279 15281 15290 15290 15296 15319 15333 15338 15349 15350 15351 15370 15377
15384 15407 15415 15431 15433 15441 15444 15447 15457 15460 15463 15469 15477 15492 15495 15498 15505 15529 15535 15536 15561 15565 15567 15568 15573 15574 15579 15581 15589 15590 15606 15615 15618 15621 15623 15625 15629 15 638 15665 15675 15677 15678 15712 15713 15718 15722
15724 15733 15748 15758 15759 15765 15787 15790 15791 15793 15811 15812 15813 15814 15821 15 826 15834 15835 15869 15871 15881 15890 15891 15896 15944 15945 15947 15948 15955 15966 15969 15987 15993 16002 16016 16036 16040 16060 1606 1 16070 16074 16080 16081 16085 16085 16088
16090 16096 16097 16100 16105 16117 16118 16125 16128 16129 16139 16141 16142 16158 16191 16193 16202 16208 16211 16215 16216 16224 16225 16226 16251 16256 16259 16278 16279 16280 16282 16290 16292 16296 16303 16320 16321 16334 16336 16 337 16339 16339 16343 16345 16360 16366
16367 16371 16398 16405 16406 16413 16423 16430 16439 16439 16446 16453 16463 16464 16466 16 467 16467 16469 16474 16497 16499 16512 16519 16519 16541 16549 16561 16565 16565 16584 16586 16589 16590 16595 16600 16626 16626 16633 16634 16641 16641 16653 16657 16671 16678 16683
16687 16693 16697 16704 16715 16717 16731 16735 16741 16742 16754 16760 16769 16798 16806 16824 16827 16828 16833 16840 16840 16853 16857 16858 16859 16878 16 883 16893 16895 16909 16925 16938 16941 16944 16948 16955 16962 16972 16983 16984 16991 1700 4 17004 17006 17013 17014
17022 17035 17040 17063 17064 17073 17086 17093 17095 17096 17103 17103 17107 17107 17110 17 117 17118 17124 17132 17137 17157 17157 17168 17182 17189 17192 17199 17204 17206 17207 17209 17222 17223 17226 17233 17236 17241 17253 17253 17260 17271 17282 172 82 17291 17295 17296
17312 17342 17350 17369 17371 17377 17398 17408 17410 17411 17420 17421 17421 17432 17437 17442 17451 17452 17461 17465 17469 17480 17482 17505 17508 17518 17524 17537 17540 17546 17549 17552 17553 17569 17571 17578 17584 17584 17589 17591 17604 17610 17611 17612 17615 17623
17632 17641 17650 17651 17659 17659 17668 17673 17683 17686 17692 17708 17713 17713 17723 17728 17762 17773 17774 17775 17776 17776 17780 17780 17807 17825 17827 17832 17839 17841 17843 17858 17860 17861 17864 17870 17877 17879 17887 17889 17893 17902 17906 17913 1791 6 17922
17922 17929 17929 17939 17945 17953 17954 17958 17964 17968 17975 17981 17982 17984 17998 18007 18008 18011 18012 18018 18023 18026 18028 18032 18035 18038 18040 18058 18060 18061 18075 18085 18086 18087 18104 18108 18110 18114 18115 18125 18127 18129 18132 18133 18135 18 136
18140 18154 18166 18166 18170 18174 18175 18190 18200 18217 18222 18230 18237 18238 18238 18240 18245 18258 18259 18259 18271 18277 18281 18283 18283 18298 18300 18318 18319 18330 18333 183 35 18337 18345 18352 18364 18366 18373 18382 18392 18396 18397 18413 18423 18434 18443
18448 18455 18456 18456 18457 18467 18470 18479 18490 18493 18503 18509 18516 18529 18536 18 538 18540 18569 18584 18585 18588 18588 18598 18610 18613 18613 18630 18631 18631 18633 18634 18636 18643 18651 18651 18661 18662 18675 18677 18678 18682 18683 18684 18686 18696 18700
18703 18706 18709 18716 18717 18718 18718 18721 18725 18738 18756 18759 18759 18762 18762 18775 18786 18 787 18792 18805 18805 18819 18823 18828 18829 18840 18842 18846 18848 18864 18866 18875 1888 2 18896 18902 18908 18913 18913 18915 18935 18938 18939 18958 18965 18990 18990
19002 19008 19019 19022 19029 19037 19044 19047 19050 19066 19067 19072 19090 19093 19094 19 095 19095 19097 19103 19104 19105 19109 19135 19149 19154 19156 19160 19161 19169 19172 19176 19178 19187 19195 19 198 19199 19203 19252 19264 19269 19271 19278 19281 19285 19285 19298
19312 19314 19353 19357 19359 19368 19369 19375 19381 19396 19397 19402 19405 19406 19410 19413 19420 19426 19435 19438 19443 19447 19463 19468 19472 19473 19485 19489 19490 19497 19522 19531 19533 19539 19552 19555 19557 19558 19567 19569 19589 19593 19601 19611 19623 19629
19631 19645 19649 19662 19664 19668 19677 19685 19690 19692 19695 19695 19711 19714 19718 19 724 19735 19737 19750 19751 19752 19761 19770 19771 19779 19785 19790 19793 19796 19801 19801 19808 19810 19812 19814 19815 1 9842 19851 19854 19854 19855 19861 19864 19866 19877 19882
19885 19891 19895 19897 19904 19911 19912 19914 19917 19919 19923 19926 19932 19948 19949 19954 19964 19974 19975 19976 19978 199 82 19991 19997 20024 20027 20037 20040 20053 20055 20061 20065 20070 20072 20072 20073 20078 20083 20083 20084 20122 20123 20124 20128 20130 20134
20135 20135 20136 20142 20149 20159 20169 20169 20170 20173 20175 20178 20183 20183 20183 20189 20189 20193 20215 20217 20222 20229 20237 20253 20259 20259 20267 20272 20274 20278 20279 20280 20289 20307 20308 20311 20315 20326 20 328 20328 20333 20337 20340 20353 20355 20356
20363 20373 20381 20383 20386 20403 20415 20415 20416 20416 20418 20424 20426 20448 20450 20454 20472 20474 20476 20481 20482 20485 20489 20493 20502 20514 20523 20528 20537 20538 20540 20542 20556 20556 20577 20580 20580 20594 20595 20 600 20601 20608 20609 20615 20620 20626
20633 20640 20643 20645 20648 20649 20652 20654 20663 20664 20666 20666 20666 20667 20671 20675 20686 20695 20703 20710 20710 20718 20722 20736 20736 20741 20747 20769 20778 20783 20785 20798 20799 20807 20825 20829 20830 20851 20851 20855 20877 20877 20888 20889 20899 20913
20920 20945 20949 20967 20967 20968 20972 20979 20990 20997 21001 21003 21005 21006 21011 21015 21016 21025 21028 21047 21051 21060 21074 21078 21080 21 080 21083 21085 21086 21090 21098 21098 21100 21108 21109 21113 21119 21132 21136 21138 21143 21153 21154 21184 21184 21188
21196 21219 21221 21221 21228 21229 21244 21265 21267 21276 21284 21286 21292 21293 21295 21300 21302 21313 21318 21321 21323 21337 21346 21358 21363 21364 21376 21388 21396 21409 21411 21411 21416 21419 21425 21430 21447 21457 21457 21459 21465 21476 21 476 21478 21479 21480
21487 21497 21501 21505 21520 21528 21538 21543 21545 21547 21547 21548 21555 21561 21562 21575 21577 21578 21595 21604 21617 21617 21624 21630 21634 21641 21659 21665 21683 21691 21693 21694 21702 21705 21710 21718 21724 21724 21726 21735 21754 21759 21763 21766 21768 21778
21781 21787 21794 21817 21839 21840 21856 21860 21862 21867 21873 21881 21892 21895 21901 21 907 21909 21911 21920 21926 21945 21945 21948 21954 21962 21963 21968 21970 21974 21979 21979 21982 21984 21991 22005 22012 22015 22015 22018 22033 22037 22044 22045 22056 22 086 22104
22106 22129 22139 22142 22148 22161 22162 22171 22186 22187 22190 22194 22197 22197 22199 22214 22225 22233 22241 22276 22279 22284 22290 22294 22296 22307 22312 22313 22336 2234 2 22348 22355 22361 22363 22386 22399 22405 22409 22413 22421 22428 22431 22466 22471 22482 22483
22492 22494 22496 22501 22511 22512 22514 22525 22530 22532 22549 22549 22566 22570 22578 22 586 22593 22593 22597 22619 22619 22630 22632 22638 22640 22646 22648 22658 22659 22663 22667 22668 22675 22678 22688 22701 22704 22708 22716 22725 22740 22741 22750 22758 22769 22777
22795 22795 22798 22813 22816 22830 22832 22844 22848 22850 22850 22858 22860 22861 22867 22869 22885 22885 22888 22892 22897 22902 22908 22912 22912 22913 22925 22929 22951 22955 22972 22972 22974 22974 22988 22999 23000 23015 23016 23017 23024 23035 23041 23043 23061 23061
23072 23073 23088 23092 23101 23105 23105 23112 23115 23116 23144 23146 23147 23152 23152 23154 23158 23 165 23168 23175 23179 23183 23186 23188 23194 23195 23196 23199 23202 23216 23224 23231 2323 4 23243 23245 23245 23256 23258 23267 23271 23277 23281 23283 23292 23296 23305
23318 23327 23332 23335 23342 23388 23390 23391 23392 23396 23400 23407 23425 23439 23445 23448 23455 23461 23481 23483 23487 23492 23495 23501 23504 23525 23532 23542 23552 23556 23569 23572 23577 23588 23589 23622 23623 23639 23646 23650 23655 23656 23661 23669 23675 23681
23683 23684 23692 23694 23699 23700 23717 23729 23743 23754 23757 23762 23775 23775 23779 23805 23811 23817 23826 23831 23838 23840 23844 23847 23849 23850 23851 23855 23856 23859 23865 23869 23888 23893 23901 23917 23936 23941 23941 23953 23955 23960 23967 23971 23977 23978
23986 23987 23990 23992 23994 24007 24007 24008 24016 24021 24028 24028 24033 24041 24050 24061 24065 24069 24075 24081 24084 24087 24099 24114 24115 24117 24118 24120 24122 24125 24129 24146 24147 24155 24160 2416 8 24169 24176 24179 24182 24196 24196 24199 24208 24209 24216
24221 24223 24227 24229 24230 24237 24241 24245 24254 24271 24272 24272 24277 24290 24300 24307 24308 24312 24314 24320 24326 24346 24348 24350 24353 24353 24355 24365 24370 24372 24389 24390 24390 24393 24395 24399 244 08 24423 24429 24441 24450 24455 24459 24464 24464 24472
24473 24474 24474 24484 24484 24488 24512 24514 24515 24520 24524 24526 24541 24546 24547 24 555 24557 24565 24567 24588 24591 24593 24593 24596 24599 24604 24616 24618 24618 24620 24626 24637 24642 24643 24648 24668 24671 24676 24684 24696 24696 24705 24710 24722 24743 24745
24750 24766 24767 24769 24773 24773 24774 24778 24779 24791 24798 24808 24815 24816 24828 24828 24828 24833 24834 24844 24855 24865 24870 24898 24901 24917 24919 24925 24937 24942 24946 24948 24956 24958 24959 24961 24962 24970 2497 9 24979 24998 25011 25012 25013 25020 25023
25027 25043 25050 25052 25058 25072 25079 25087 25089 25095 25107 25128 25128 25134 25141 25 149 25162 25167 25184 25190 25191 25197 25200 25205 25215 25230 25236 25249 25253 25264 25264 25269 25269 25293 25296 25302 25313 25314 25316 25318 25328 25329 25333 25345 25347 25367
25385 25386 25391 25395 25402 25403 25411 25423 25428 25429 25436 25442 25449 25452 25452 25456 25472 25476 25484 25502 25508 25518 25519 25524 25542 25 547 25547 25547 25561 25563 25584 25587 25598 25603 25605 25608 25616 25619 25620 25624 2562 7 25629 25631 25631 25633 25656
25667 25668 25678 25679 25680 25686 25697 25705 25706 25710 25713 25721 25722 25734 25739 25 739 25759 25760 25770 25776 25783 25790 25790 25791 25808 25813 25822 25824 25824 25828 25834 25836 25841 25846 25858 25867 25874 25880 25893 25897 25898 25903 25917 25923 25928 25951
25960 25967 25981 25988 25990 25996 26018 26021 26031 26034 26040 26048 26052 26053 26058 26063 26067 26068 26072 26074 26099 26101 26113 26115 26122 26124 26126 26 129 26133 26134 26152 26153 26154 26160 26173 26177 26182 26200 26203 26206 26222 26224 26248 26253 26255 26260
26260 26260 26264 26268 26281 26291 26292 26299 26302 26303 26308 26312 26321 26333 26358 26 362 26363 26363 26364 26385 26385 26386 26412 26418 26423 26424 26428 26431 26434 26439 26443 26444 26463 26467 26477 26484 26488 26489 26500 26504 26517 26518 26528 26534 26539 26555
26569 26576 26578 26584 26588 26610 26610 26611 26615 26624 26630 26632 26633 26641 26653 26658 26667 26679 26685 26701 26705 26720 26727 26737 26740 26746 26758 26777 26781 26787 26790 26792 26792 26793 26798 26803 26804 26806 26807 26809 26811 26814 26814 26816 26819 26 821
26835 26841 26847 26850 26857 26859 26865 26867 26869 26880 26886 26890 26897 26900 26909 26 919 26919 26924 26925 26928 26943 26946 26946 26947 26948 26949 26962 26969 26979 26984 2700 5 27007 27008 27032 27037 27038 27038 27043 27053 27065 27065 27067 27080 27085 27088 27089
27091 27098 27109 27123 27124 27137 27152 27157 27168 27171 27182 27189 27196 27200 27216 27 219 27224 27251 27252 27256 27264 27273 27283 27296 27296 27297 27311 27330 27338 27348 27350 27352 27358 27362 27368 27370 27372 27384 27393 27395 27415 27416 27432 27432 27437 27440
27441 27442 27446 27465 27478 27479 27489 27504 27505 27506 27529 27530 27531 27553 27577 27577 27577 27579 27580 27587 27587 27587 27590 27593 27594 27595 27602 27606 27607 27611 27616 27621 27624 27626 27633 27644 27649 27649 27651 27663 27666 27669 27671 27681 27689 27692
27700 27705 27714 27726 27732 27734 27753 27753 27754 27756 27759 27760 27792 27799 27804 27 809 27813 27830 27834 27837 27841 27842 27844 27870 27873 27892 27892 27892 27896 27909 27918 27918 27936 27 936 27938 27956 27967 27982 27988 27999 28009 28019 28022 28023 28026 28027
28029 28042 28047 28049 28053 28070 28074 28074 28074 28074 28082 28082 28094 28099 28102 28112 28118 28119 281 28 28130 28134 28135 28145 28148 28149 28162 28164 28168 28180 28182 28211 28213 28223 28223 28233 28240 28245 28246 28252 28253 28255 28262 28274 28286 28287 28289
28290 28290 28295 28296 28297 28299 28313 28315 28315 28317 28318 28318 28321 28323 28325 28 343 28350 28356 28366 28368 28382 28392 28396 28400 28402 28406 28410 28411 28422 28423 28428 28433 28440 28442 28458 28464 28469 28470 28476 28486 28487 28488 28489 28498 28499 28503
28504 28505 28510 28520 28522 28522 28532 28564 28569 28570 28580 28583 28583 28592 28596 28607 28614 28617 28621 28630 2863 3 28641 28642 28650 28652 28664 28666 28680 28681 28685 28689 28692 28703 28703 28704 28712 28733 28745 28747 28761 28765 28768 28773 28781 28782 28786
28791 28801 28804 28822 28834 28838 28854 28856 28862 28869 28870 28878 28888 28888 28892 28 942 28956 28960 28962 28963 28970 28978 28981 28995 29001 29007 29011 29011 29022 29033 29065 29074 29082 29087 29091 29102 29105 29126 29130 29130 29141 29146 29151 29152 29153 29156
29168 29170 29171 29173 29174 29174 29182 29200 29213 29213 29218 29221 29235 29236 29249 29250 29253 29256 29264 29271 29271 29288 29292 29292 29301 29309 29313 29314 29331 29334 29334 29337 29350 29352 29356 29358 29361 29361 29 372 29383 29400 29421 29421 29426 29427 29444
29445 29447 29448 29458 29465 29472 29478 29486 29492 29503 29510 29515 29527 29541 29554 29 556 29556 29560 29561 29562 29565 29577 29591 29608 29613 29614 29617 29617 29621 29643 29656 29657 29658 29669 29681 29681 29704 29731 29733 29734 29744 29749 29756 29761 29763 29768
29768 29777 29789 29790 29795 29812 29815 29832 29833 29849 29855 29855 29857 29859 29866 29869 29869 29873 29876 29881 29891 29897 29901 29909 29910 29916 29929 29935 29942 29942 29947 29954 29956 29959 29962 29972 29975 29977 29979 29986 29993 29996 30003 30032 30037 30038
30041 30048 30049 30062 30066 30080 30093 30096 30104 30106 30109 30114 30119 30134 30137 30 145 30169 30175 30180 30188 30189 30191 30195 30211 30212 30221 30227 30227 30231 30238 30245 30259 30260 30270 30271 30300 30301 30303 30308 30323 30333 30 335 30336 30338 30345 30350
30397 30406 30412 30422 30424 30432 30435 30466 30470 30470 30499 30502 30510 30511 30519 30523 30524 30527 30538 30548 30556 30568 30574 30581 30591 30614 30623 30624 30630 30643 30648 30654 30664 30665 30674 30693 30695 30712 30714 30721 30731 30732 30 742 30771 30774 30775
30783 30786 30787 30792 30792 30806 30807 30811 30814 30816 30833 30833 30836 30836 30837 30838 30843 30858 30862 30875 30876 30877 30883 30885 30900 30906 30910 30931 30932 30935 30946 30947 30953 30971 30971 30974 30974 30977 31000 31001 31003 31004 31015 310 20 31033 31034
31036 31056 31060 31063 31065 31066 31068 31071 31088 31098 31101 31102 31107 31111 31111 31115 31122 31149 31151 31155 31159 31163 31165 31172 31175 31180 31185 31196 31202 31203 31226 31240 31244 31245 31250 31256 31260 31269 31270 31274 31276 31283 31286 31302 31310 31310
31311 31313 31314 31316 31322 31329 31339 31347 31348 31351 31357 31361 31371 31376 31413 31417 31418 31426 31426 31441 31447 31450 31453 31461 31461 31463 31467 31476 31478 31490 31493 31495 31496 31497 31502 31505 31506 31522 31531 31539 31540 31547 31550 31552 31556 31561
31577 31579 31585 31591 31597 31597 31601 31620 31622 31626 31627 31635 31641 31641 31647 31 654 31665 31673 31676 31687 31690 31708 31717 31723 31741 31744 31754 31754 31758 31762 31768 31783 31785 31805 31810 31812 31818 31864 31896 31901 31907 31913 31918 31920 31920 31923
31928 31934 31947 31981 31982 31988 31993 31998 31999 32000 32018 32019 32020 32029 32036 32046 32 050 32053 32060 32072 32074 32075 32080 32091 32094 32097 32106 32119 32125 32143 32145 32145 32168 32170 32176 32179 32179 32182 32190 32195 32196 32200 32203 32209 32209 32226
32240 32255 32257 32261 32270 32271 32301 32331 32356 32371 32372 32389 32389 32391 32404 32 405 32425 32439 32444 32468 32469 32471 32471 32482 32488 32498 32499 32501 32503 32506 32517 32521 32525 32 528 32544 32557 32570 32584 32588 32591 32604 32607 32609 32611 32612 32618

32621 32621 32627 32628 32629 32637 32651 32652 32657 32662 32668 32671 32676 32677 32678 32683 32685 32686 32 701 32702 32702 32702 32703 32707 32715 32718 32719 32726 32729 32736 32745 32756 32757 32764
32765
Time taken to sort: 0.000000 second

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
11. Write C program that accepts the vertices and edges for a graph and stores it as
an adjacency matrix.
#include <stdio.h>
#define MAX_VERTICES 100
int main()
{
int adjMatrix[MAX_VERTICES][MAX_VERTICES] = {0};
int numVertices, numEdges;
int i, j, u, v;
printf("Enter the number of vertices in the graph: ");
scanf("%d", &numVertices);
printf("Enter the number of edges in the graph: ");
scanf("%d", &numEdges);
// Accept the edges from the user and store them in the adjacency matrix
printf("Enter the edges (u, v):\n");
for (i = 0; i < numEdges; i++)
{
scanf("%d %d", &u, &v);
adjMatrix[u][v] = 1;
adjMatrix[v][u] = 1; // If the graph is undirected, set both vertices as adjacent
}
// Display the adjacency matrix
printf("\nAdjacency Matrix:\n");
for (i = 0; i < numVertices; i++)
{
for (j = 0; j < numVertices; j++)
{
printf("%d ", adjMatrix[i][j]);
}
printf("\n");
}
return 0;

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
}
-----------------------------------------OUTPUT----------------------------------------
Enter the number of vertices in the graph: 3
Enter the number of edges in the graph: 3
Enter the edges (u, v):
01
10
01
Adjacency Matrix:
010
100
000

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
12. Implement function to print In-Degree, Out-Degree and to display that
adjacency matrix.
#include <stdio.h>
#define MAX_VERTICES 100
// Function to display the adjacency matrix
void displayMatrix(int graph[MAX_VERTICES][MAX_VERTICES], int vertices)
{
int i, j;
printf("Adjacency Matrix:\n");
for (i = 0; i < vertices; i++)
{
for (j = 0; j < vertices; j++)
{
printf("%d ", graph[i][j]);
}
printf("\n");
}
}
// Function to calculate and display in-degree and outdegree of each vertex
void calculateDegree(int
graph[MAX_VERTICES][MAX_VERTICES],
int vertices)
{
int i, j;
printf("\n Vertex\t In-Degree \t Out-Degree\n");
for (i = 0; i < vertices; i++)
{
int inDegree = 0, outDegree = 0;
for (j = 0; j < vertices; j++)
{
inDegree += graph[j][i]; // Count incoming
edges

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
outDegree += graph[i][j]; // Count outgoing
edges
}
printf("%d\t%d\t\t%d\n", i + 1, inDegree,
outDegree);
}
}
int main()
{
int vertices, i, j;
printf("Enter the number of vertices: ");
scanf("%d", &vertices);
int graph[MAX_VERTICES][MAX_VERTICES];
printf("Enter the adjacency matrix:\n");
for (i = 0; i < vertices; i++)
{
for (j = 0; j < vertices; j++)
{
scanf("%d", &graph[i][j]);
}
}
displayMatrix(graph, vertices);
calculateDegree(graph, vertices);
return 0;
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
-----------------------------------------OUTPUT----------------------------------------
Enter the number of vertices: 3
Enter the adjacency matrix:
011
001
000
Adjacency Matrix:
011
001
000
Vertex In-Degree Out-Degree
102
211
320

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
13. Write program to implement backtracking algorithm for solving problems like
N queens.
#include <stdio.h>
#include <math.h>
int board[20], count;
int main()
{
int n, i, j;
void queen(int row, int n);

printf(" - N Queens Problem Using Backtracking -");

printf("\n\nEnter number of Queens:");
scanf("%d", &n);
queen(1, n);
return 0;
}

// function for printing the solution

void print(int n)
{
int i, j;
printf("\n\nSolution %d:\n\n", ++count);

for (i = 1; i <= n; ++i)

printf("\t%d", i);

for (i = 1; i <= n; ++i)

{
printf("\n\n%d", i);
for (j = 1; j <= n; ++j) // for nxn board
{
if (board[i] == j)

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
printf("\tQ"); // queen at i,j position
else
printf("\t-"); // empty slot
}
}
}

/*funtion to check conflicts

If no conflict for desired postion returns 1 otherwise returns 0*/
int place(int row, int column)
{
int i;
for (i = 1; i <= row - 1; ++i)
{
// checking column and digonal conflicts
if (board[i] == column)
return 0;
else if (abs(board[i] - column) == abs(i - row))
return 0;
}
return 1; // no conflicts
}

// function to check for proper positioning of queen

void queen(int row, int n)
{
int column;
for (column = 1; column <= n; ++column)
{
if (place(row, column))
{
board[row] = column; // no conflicts so place queen

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
if (row == n) // dead end
print(n); // printing the board configuration
else // try queen with
next position;
queen(row + 1, n);
}
}
}
-----------------------------------------OUTPUT----------------------------------------
Enter number of Queens:4
Solution 1:
1 2 3 4
1 - Q - -
2 - - - Q
3 Q - - -
4 - - Q -
Solution 2:
1 2 3 4
1 - - Q -
2 Q - - -
3 - - - Q
4 - Q - -

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
14. Write a program to implement the backtracking algorithm for the sum of
subsets problem
#include <stdio.h>
#include <stdlib.h>
static int total_nodes;
void printValues(int A[], int size)
{
int i;
for (i = 0; i < size; i++)
{
printf("%*d", 5, A[i]);
}
printf("\n");
}
void subset_sum(int s[], int t[], int s_size, int t_size, int sum,
int ite, int const target_sum)
{
int i;
total_nodes++;
if (target_sum == sum)
{
printValues(t, t_size);
subset_sum(s, t, s_size, t_size - 1, sum - s[ite], ite + 1,
target_sum);
return;
}
else
{
for (i = ite; i < s_size; i++)
{
t[t_size] = s[i];
subset_sum(s, t, s_size, t_size + 1, sum + s[i], i + 1,

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
target_sum);
}
}
}
void generateSubsets(int s[], int size, int target_sum)
{
int *tuplet_vector = (int *)malloc(size * sizeof(int));
subset_sum(s, tuplet_vector, size, 0, 0, 0, target_sum);
free(tuplet_vector);
}
int main()
{
int set[] = {5, 6, 12, 54, 2, 20, 15};
int size = sizeof(set) / sizeof(set[0]);
printf("The set is ");
printValues(set, size);
generateSubsets(set, size, 25);
printf("Total Nodes generated %d\n", total_nodes);
return 0;
}
-----------------------------------------OUTPUT----------------------------------------
The set is 5 6 12 54 2 20 15
5 6 12 2
5 20
Total Nodes generated 127

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
15. Write program to implement greedy algorithm for job sequencing with
deadlines.
#include <stdio.h>
// Structure to represent a job
struct Job
{
char id;
int deadline;
int profit;
};
// Function to perform job sequencing using greedy algorithm
void jobSequencing(struct Job jobs[], int n);
int main()
{
// Example jobs
struct Job jobs[] = {
{'a', 2, 100},
{'b', 1, 19},
{'c', 2, 27},
{'d', 1, 25},
{'e', 3, 15}};
int n = sizeof(jobs) / sizeof(jobs[0]);
// Perform job sequencing
jobSequencing(jobs, n);
return 0;
}
// Function to perform job sequencing using greedy algorithm
void jobSequencing(struct Job jobs[], int n)
{
int i, j;
// Sort jobs based on their profits in descending order
for (i = 0; i < n - 1; i++)

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
{
for (j = i + 1; j < n; j++)
{
if (jobs[i].profit < jobs[j].profit)
{
// Swap jobs if they are out of order
struct Job temp = jobs[i];
jobs[i] = jobs[j];
jobs[j] = temp;
}
}
}
// Array to store the result
char result[n];
// Array to keep track of time slots
int slots[n];
// Initialize slots array
for (i = 0; i < n; i++)
{
slots[i] = -1;
}
// Fill the result array and update time slots
for (i = 0; i < n; i++)
{
for (j = jobs[i].deadline - 1; j >= 0; j--)
{
if (slots[j] == -1)
{
// Found a free slot, assign the job
result[j] = jobs[i].id;
slots[j] = i;
break;

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
}
}
}
// Print the result
printf("Job Sequence: ");
for (i = 0; i < n; i++)
{
if (slots[i] != -1)
{
printf("%c ", result[i]);
}
}
printf("\n");
}
-----------------------------------------OUTPUT----------------------------------------
Job Sequence: c a e

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
16. Write program to implement Dynamic Programming algorithm for the
Optimal Binary Search Tree Problem.
#include <stdio.h>
#include <limits.h>
// A utility function to get sum of array elements freq[i] to freq[j]
int sum(int freq[], int i, int j);
int optimalSearchTree(int keys[], int freq[], int n)
{
/* Create an auxiliary 2D matrix to store results of subproblems */
int cost[n][n];
/* cost[i][j] = Optimal cost of binary search tree that can be formed from
keys[i] to keys[j].cost[0][n-1] will store the resultant cost */
// For a single key, cost is equal to frequency of the key
for (int i = 0; i < n; i++)
cost[i][i] = freq[i];
for (int L = 2; L <= n; L++)
{
for (int i = 0; i <= n - L + 1; i++)
{
int j = i + L - 1;
int off_set_sum = sum(freq, i, j);
cost[i][j] = INT_MAX;
for (int r = i; r <= j; r++)
{
// c = cost when keys[r] becomes root of this subtree
int c = ((r > i) ? cost[i][r - 1] : 0) +
((r < j) ? cost[r + 1][j] : 0) +
off_set_sum;
if (c < cost[i][j])
cost[i][j] = c;
}
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
}
return cost[0][n - 1];
}
int sum(int freq[], int i, int j)
{
int s = 0;
for (int k = i; k <= j; k++)
s += freq[k];
return s;
}
int main()
{
int keys[] = {10, 12, 20};
int freq[] = {34, 8, 50};
int n = sizeof(keys) / sizeof(keys[0]);
printf("Cost of Optimal BST is %d ", optimalSearchTree(keys, freq, n));
return 0;
}
-----------------------------------------OUTPUT----------------------------------------
Cost of Optimal BST is 142

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
17. Write a program that implements Prim’s algorithm to generate minimum cost
spanning Tree.
#include <stdio.h>
#include <stdlib.h>
#define infinity 9999
#define MAX 20
int G[MAX][MAX], spanning[MAX][MAX], n;
int prims();
int main()
{
int i, j, total_cost;
printf("Enter no. of vertices:");
scanf("%d", &n);
printf("\nEnter the adjacency matrix:\n");
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
scanf("%d", &G[i][j]);
total_cost = prims();
printf("\nspanning tree matrix:\n");
for (i = 0; i < n; i++)
{
printf("\n");
for (j = 0; j < n; j++)
printf("%d\t", spanning[i][j]);
}
printf("\n\nTotal cost of spanning tree=%d", total_cost);
return 0;
}
int prims()
{
int cost[MAX][MAX];
int u, v, min_distance, distance[MAX], from[MAX];

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
int visited[MAX], no_of_edges, i, min_cost, j;
// create cost[][] matrix,spanning[][]
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
{
if (G[i][j] == 0)
cost[i][j] = infinity;
else
cost[i][j] = G[i][j];
spanning[i][j] = 0;
}
// initialise visited[],distance[] and from[]
distance[0] = 0;
visited[0] = 1;
for (i = 1; i < n; i++)
{
distance[i] = cost[0][i];
from[i] = 0;
visited[i] = 0;
}
min_cost = 0; // cost of spanning tree
no_of_edges = n - 1; // no. of edges to be added
while (no_of_edges > 0)
{
// find the vertex at minimum distance from the tree
min_distance = infinity;
for (i = 1; i < n; i++)
if (visited[i] == 0 && distance[i] < min_distance)
{
v = i;
min_distance = distance[i];
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
u = from[v];
// insert the edge in spanning tree
spanning[u][v] = distance[v];
spanning[v][u] = distance[v];
no_of_edges--;
visited[v] = 1;
// updated the distance[] array
for (i = 1; i < n; i++)
if (visited[i] == 0 && cost[i][v] < distance[i])
{
distance[i] = cost[i][v];
from[i] = v;
}
min_cost = min_cost + cost[u][v];
}
return (min_cost);
}
-----------------------------------------OUTPUT----------------------------------------
Enter no. of vertices:3
Enter the adjacency matrix:
011
101
110
spanning tree matrix:
011
100
100
Total cost of spanning tree=2

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
18. Write a program that implements Kruskal’s algorithm to generate minimum
cost spanning tree.
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
int i, j, k, a, b, u, v, n, ne = 1;
int min, mincost = 0, cost[9][9], parent[9];
int find(int);
int uni(int, int);
void main()
{
printf("Enter the no. of vertices:\n");
scanf("%d", &n);
printf("\nEnter the cost adjacency matrix:\n");
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
scanf("%d", &cost[i][j]);
if (cost[i][j] == 0)
cost[i][j] = 999;
}
}
printf("The edges of Minimum Cost Spanning Tree are\n");
while (ne < n)
{
for (i = 1, min = 999; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (cost[i][j] < min)
{

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
min = cost[i][j];
a = u = i;
b = v = j;
}
}
}
u = find(u);
v = find(v);
if (uni(u, v))
{
printf("%d edge (%d,%d) =%d\n", ne++, a, b, min);
mincost += min;
}
cost[a][b] = cost[b][a] = 999;
}
printf("\nMinimum cost = %d\n", mincost);
getch();
}

int find(int i)
{
while (parent[i])
i = parent[i];
return i;
}
int uni(int i, int j)
{
if (i != j)
{
parent[j] = i;
return 1;
}

DEPT. OF COMPUTER SCIENCE Page No. _____

 SHREE MEDHA DEGREE COLLEGE, BALLARI
return 0;
}
-----------------------------------------OUTPUT----------------------------------------
Enter the no. of vertices:
4
Enter the cost adjacency matrix:
2546
3281
9628
5160
The edges of Minimum Cost Spanning Tree are
1 edge (2,4) =1
2 edge (2,1) =3
3 edge (1,3) =4

Minimum cost = 8

DEPT. OF COMPUTER SCIENCE Page No. _____