Scribd
Upload
5 views5 pages

Merge and Quick Sort Algorithms

The document contains two sorting algorithms implemented in C: Merge Sort and Quick Sort. Each algorithm includes functions for sorting an array, merging sorted halves, and printing the sorted array. The main function for both algorithms prompts the user for input, sorts the array, and displays the sorted result.

Uploaded by

23pa1a4271
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views5 pages

Merge and Quick Sort Algorithms

The document contains two sorting algorithms implemented in C: Merge Sort and Quick Sort. Each algorithm includes functions for sorting an array, merging sorted halves, and printing the sorted array. The main function for both algorithms prompts the user for input, sorts the array, and displays the sorted result.

Uploaded by

23pa1a4271
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Merge sort

#include <stdio.h>

//** Merge function to merge two halves**//

void merge(int arr[], int low, int mid, int high)

int n1 = mid - low + 1;

int n2 = high - mid;

int L[n1], R[n2];

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

L[i] = arr[low + i];

for (int j = 0; j < n2; j++)

R[j] = arr[mid + 1 + j];

int i = 0, j = 0, k = low;

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];

j++;

k++;

// **Merge Sort function**//

void mergeSort(int arr[], int low, int high) {

if (low < high) {

int mid = low + (high - low) / 2;

mergeSort(arr, low, mid);

mergeSort(arr, mid + 1, high);

merge(arr, low, mid, high);

// **Function to print the array**//

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

for (int i = 0; i < size; i++)

printf("%d ", arr[i]);

printf("\n");

// **Main function**//

int main()

{
int n;

printf("Enter number of elements: ");

scanf("%d", &n);

int arr[n];

printf("Enter %d elements: ", n);

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

scanf("%d", &arr[i]);

mergeSort(arr, 0, n - 1);

printf("Sorted array using Merge Sort: ");

printArray(arr, n);

return 0;

Quick sort

#include <stdio.h>

// **Function to perform partition**//

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

int pivot = arr[low]; // **First element as pivot**//

int L = low;

int R = high;

while (L < R) {

// **1st Condition: P < R → Decrement R**//

while (pivot < arr[R])

R--;

if (L < R)
{

arr[L] = arr[R];

// **2nd Condition: P > L → Increment L**//

while (pivot > arr[L])

L++;

if (L < R) {

arr[R] = arr[L];

arr[R] = pivot;

return R;

// **Quick Sort Function**//

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

if (low < high) {

int pivotIndex = partition(arr, low, high); // **Get pivot position**//

quickSort(arr, low, pivotIndex - 1); // **Sort left half**//

quickSort(arr, pivotIndex + 1, high); // **Sort right half**//

int main()

int n;

printf("Enter the number of elements: ");


scanf("%d", &n);

int arr[n];

printf("Enter the elements: ");

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

scanf("%d", &arr[i]);

quickSort(arr, 0, n - 1);

printf("Sorted array: ");

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

printf("%d ", arr[i]);

printf("\n");

return 0;

You might also like