merge_sort.c File Reference

Implementation of merge sort algorithm. More...

#include <stdio.h>
#include <stdlib.h>

Include dependency graph for merge_sort.c:

Functions
void	swap (int *a, int *b)
	Swap two integer variables.
void	merge (int *a, int l, int r, int n)
	Perform merge of segments.
void	merge_sort (int *a, int n, int l, int r)
	Merge sort algorithm implementation.
int	main (void)
	Main function.

Detailed Description

Implementation of merge sort algorithm.

Function Documentation

main()

int main

(

void

)

Main function.

{
    int *a, n, i;
    printf("Enter Array size: ");
    scanf("%d", &n);
    if (n <= 0) /* exit program if arraysize is not greater than 0 */
    {
        printf("Array size must be Greater than 0!\n");
        return 1;
    }
    a = (int *)malloc(n * sizeof(int));
    if (a == NULL) /* exit program if can't malloc memory */
    {
        printf("Can't Malloc! Please try again.");
        return 1;
    }
    for (i = 0; i < n; i++)
    {
        printf("Enter number[%d]: ", i);
        scanf("%d", &a[i]);
    }
 
    merge_sort(a, n, 0, n - 1);
    printf("Sorted Array: ");
    for (i = 0; i < n; i++)
    {
        printf("%d ", a[i]);
    }
    printf("\n");
 
    free(a);
 
    return 0;
}

Here is the call graph for this function: