DSC314 Data Structure Lab2

8.
Merge sort(divide and conquer algorithm)
#include <stdio.h>
// Function to merge two subarrays of arr[]

void merge(int arr[], int left, int mid, int right)
{
int n1 = mid - left + 1;
int n2 = right - mid;
// Create temporary arrays

int L[n1], R[n2];
// Copy data to temporary arrays L[] and R[]

for (int i = 0; i < n1; i++)
L[i] = arr[left + i];
for (int j = 0; j < n2; j++)
R[j] = arr[mid + 1 + j];
// Merge the temporary arrays back into arr[left..right]

int i = 0; // Initial index of first subarray
int j = 0; // Initial index of second subarray
int k = left; // Initial index of merged subarray
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
// Copy the remaining elements of L[], if any

while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
// Copy the remaining elements of R[], if any

while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
// Function to implement merge sort

void mergeSort(int arr[], int left, int right)
{
if (left < right)
{
// Find the middle point
int mid = left + (right - left) / 2;
// Sort first and second halves

mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);
// Merge the sorted halves

merge(arr, left, mid, right);
}
}
// Function to print the array

void printArray(int arr[], int size)
{
for (int i = 0; i < size; i++)
printf("%d ", arr[i]);
printf("\n");
}
int main()
{
int arr[] = {12, 11, 13, 5, 6, 7};
int arr_size = sizeof(arr) / sizeof(arr[0]);
printf("Given array is \n");

printArray(arr, arr_size);
mergeSort(arr, 0, arr_size - 1);
printf("\nSorted array is \n");

printArray(arr, arr_size);
return 0;
}
9.Quick Sort
https://www.geeksforgeeks.org/quick-sort-algorithm/
#include <stdio.h>
void swap(int* p1, int* p2)
{
int temp;
temp = *p1;
*p1 = *p2;
*p2 = temp;
}
int partition(int arr[], int low, int high)

{
int pivot = arr[high];
int i = (low - 1);
for (int j = low; j <= high - 1; j++) {
if (arr[j] < pivot) {
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
void quickSort(int arr[], int low, int high)

{
if (low < high) {
int pi = partition(arr, low, high);

quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
int main()
{
int arr[] = { 10, 7, 8, 9, 1, 5 };
int n = sizeof(arr) / sizeof(arr[0]);
quickSort(arr, 0, n - 1);
printf("Sorted Array\n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
return 0;
}
10.binary search
#include <stdio.h>
int binarySearch(int arr[], int low, int high, int x)

{
while (low <= high) {
int mid = low + (high - low) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] < x)
low = mid + 1;
else
high = mid - 1;
}
return -1;
}
int main(void)
{
int arr[] = { 2, 3, 4, 10, 40 };
int n = sizeof(arr) / sizeof(arr[0]);
int x = 10;
int result = binarySearch(arr, 0, n - 1, x);
if(result == -1) printf("Element is not present in array");
else printf("Element is present at index %d",result);
11.stack operation
#include <stdio.h>
#define STACKSIZE 100
struct stack
{
int a[STACKSIZE];
int top;
};
struct stack s;
void push(void);
int pop(void);
void display(void);
void main ()
{
int choice;
int option = 1;
s.top = -1;
printf ("STACK OPERATION\n");

while (option)
{
printf ("------------------------------------------\n");
printf (" 1 --> PUSH \n");
printf (" 2 --> POP \n");
printf (" 3 --> DISPLAY \n");
printf (" 4 --> EXIT \n");
printf ("------------------------------------------\n");
printf ("Enter your choice\n");

scanf ("%d", &choice);
switch (choice)
{
case 1:
push();
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
return;
}
printf ("Do you want to continue(Type 0 (no)or 1(yes))?\n");

scanf ("%d", &option);
}
}
/* Function to add an element to the stack */
void push ()
{
int num;
if (s.top == (STACKSIZE - 1))
{
printf ("Stack is Full\n");
return;
}
else
{
printf ("Enter the element to be pushed\n");
scanf ("%d", &num);
s.top = s.top + 1;
s.a[s.top] = num;
}
return;
}
/* Function to delete an element from the stack */
int pop ()
{
int num;
if (s.top == - 1)
{
printf ("Stack is Empty\n");
return (s.top);
}
else
{
num = s.a[s.top];
printf ("poped element is = %d\n", s.a[s.top]);
s.top = s.top - 1;
}
return(num);
}
/* Function to display the status of the stack */
void display ()
{
int i;
if (s.top == -1)
{
printf ("Stack is empty\n");
return;
}
else
{
printf ("\n The status of the stack is \n");
for (i = s.top; i >= 0; i--)
{
printf ("%d\n", s.a[i]);
}
}
printf ("\n");
}

DSC314 Data Structure Lab2

Uploaded by

Copyright:

Available Formats

DSC314 Data Structure Lab2

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSC314 Data Structure Lab2

Uploaded by

Copyright:

Available Formats

8.

Merge sort(divide and conquer algorithm)

// Function to merge two subarrays of arr[]

// Create temporary arrays

// Copy data to temporary arrays L[] and R[]

// Merge the temporary arrays back into arr[left..right]

// Copy the remaining elements of L[], if any

// Copy the remaining elements of R[], if any

// Function to implement merge sort

// Sort first and second halves

// Merge the sorted halves

// Function to print the array

printf("Given array is \n");

mergeSort(arr, 0, arr_size - 1);

printf("\nSorted array is \n");

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

int pivot = arr[high];

int i = (low - 1);

for (int j = low; j <= high - 1; j++) {

if (arr[j] < pivot) {

void quickSort(int arr[], int low, int high)

int pi = partition(arr, low, high);

int binarySearch(int arr[], int low, int high, int x)

printf ("STACK OPERATION\n");

printf ("Enter your choice\n");

printf ("Do you want to continue(Type 0 (no)or 1(yes))?\n");

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.