Scribd
Upload
2 views

Lab Assignments_07 DS

Uploaded by

hernotebook96
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Lab Assignments_07 DS

Uploaded by

hernotebook96
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Name-Devansh Singh Nikam

Enrollment no:-0801IT231043
Batch A2

Lab Assignments_07

Que1)Write a program to sort data using merge sort.

● Program:-
#include <stdio.h>

void merge(int arr[], int l, int m, int r) {


int n1 = m - l + 1;
int n2 = r - m;
int L[n1], R[n2];

for (int i = 0; i < n1; i++) {


L[i] = arr[l + i];
}
for (int j = 0; j < n2; j++) {
R[j] = arr[m + 1 + j];
}

int i = 0, j = 0, k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
k++;
}

while (i < n1) {


arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

j++;
k++;
}
}

void mergeSort(int arr[], int l, int r) {


if (l < r) {
int m = l + (r - l) / 2;
mergeSort(arr, l, m);
mergeSort(arr, m + 1, r);
merge(arr, l, m, r);
}
}

void printArray(int arr[], int size) {


for (int i = 0; i < size; i++) {
printf("%d ", arr[i]);
}
printf("\n");
}

int main() {
int arr[] = {5, 2, 8, 3, 1, 6, 4};
int n = sizeof(arr) / sizeof(arr[0]);

printf("Original array: ");


printArray(arr, n);

mergeSort(arr, 0, n - 1);

printf("Sorted array(by merge sort): ");


printArray(arr, n);

return 0;
}
● Output:-
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

Que2) Write a program to sort data using insertion sort.

● Program:-
#include <stdio.h>

void insertionSort(int arr[], int n) {


int i, j, key;
for (i = 1; i < n; i++) {
key = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}

int main() {
int arr[] = {5, 2, 8, 3, 1, 6, 4};

int n = sizeof(arr) / sizeof(arr[0]);

printf("Original array: ");


for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
insertionSort(arr, n);
printf("Sorted array(by insertion sort): ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}

return 0;
}
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

● Output:-
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

Que3) Write a program to sort data using bubble sort.

● Program:-
#include <stdio.h>

void bubbleSort(int arr[], int n) {


int i, j, temp;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}

int main() {

int arr[] = {5, 2, 8, 3, 1, 6, 4};


int n = sizeof(arr) / sizeof(arr[0]);

printf("Original array: ");


for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}

printf("\n");

bubbleSort(arr, n);
printf("Sorted array (by bubble sort): ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}

return 0;
}
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

● Output:-
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

Que4) Write a program to sort data using selection sort.

● Program:-
#include <stdio.h>

void selectionSort(int arr[], int n) {


int i, j, min, temp;
for (i = 0; i < n - 1; i++) {
min = i;
for (j = i + 1; j < n; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
temp = arr[i];
arr[i] = arr[min];
arr[min] = temp;
}
}
int main() {
int arr[] = {5, 2, 8, 3, 1, 6, 4};
int n = sizeof(arr) / sizeof(arr[0]);

printf("Sorted array: ");


for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
selectionSort(arr, n);
printf("Sorted array(by selection sort): ");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}

return 0;
}
Name-Devansh Singh Nikam
Enrollment no:-0801IT231043
Batch A2

● Output:-

You might also like