C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C Prime Number code in C Factorial Program in C using For Loop Factorial Program in C Using While Loop Fibonacci Series in C Using For Loop Fibonacci series in C using while loop Prime Number Program in C using for Loop While Loop in C programming examples Built-in functions in C Assert() Function C vs Java Strings Call Back Function in Embedded C Else If Ladder fgets() function Ftell() Function getc() function getch() function gets() function Heap Sort Nested if-else statement Pi() Function Positioning of file Write() function abs() function in C Attributes in C C program to find factorial of a number using Recursion Ferror() in c fopen() function in C Fibonacci series program in C using Recursion Formatted Input and output function in C Snake Game in C User Defined Functions in C Beep() function in C Cbrt() function in C Hook() function in C Isalnum() function in C C Program to find the Roots of a Quadratic Equation C Switch Statements Difference between rand() and srand() function in C Difference between while and for loop in C Doubly Linked list in C Example of Iteration in C How to use atoi() function in C How to use floor() function in C How to use sine() function in C How to use Typedef Struct in C Integer Promotions in C C Program Swap Numbers in cyclic order Using Call by Reference C Program to Find Largest Number Using Dynamic Memory Allocation C Program to Find the Largest Number using Ternary Operator C/C++ Program to Find the Size of int, float, double and char Find the Largest Three Distinct Elements in an Array using C/C++ Loop Questions in C Modulus on Negative Numbers in C Multiplication table program in C using For loop Nested Loops in C Programming Examples C Program for Mean and Median of an Unsorted Array Results of Comparison Operations in C and C++ Reverse a Stack using Recursion in C Simple hash() function in C strcat() Function in C Sum of N numbers in C using For loop Use of free() function in C Write a program that produces different results in C and C++ C Function Argument and Return Values Keywords in C Bank management system in C Calendar application in C Floor() Function in C Free() Function in C How to delete a file in C How to move a text in C Remove an element from an array in C Unformatted input() and output() function in C What are linker and loader in C SJF Scheduling Program in C Socket Programming in C Structure in C Tower of Hanoi in C Union Program in C Variable Declaration in C What is Linked List in C While Loop Syntax in C fork() in C GCD program in C Branching Statements in C Comma Operator in C Control statement in C Double Specifier in C How to create a binary file in C Long int in C Palindrome Number in C Pure Virtual Function in C Run Time Polymorphism in C Types of Array in C Types of Function in C What is a buffer in C What is required in each C Program Associativity of Operators in C Bit Stuffing Program in C Actual and Formal Parameters Addition of two Numbers in C Advantages of function in C Arithmetic Progression Program in C Binomial Coefficient Program in C Difference between Array and List in C Diffie-Hellman Algorithm in C How to convert a number to words in C How to convert a string to hexadecimal in C Difference between If and Switch Statement in C C and C++ Binary Files C program that does not Suspend when Ctrl+Z is Pressed Different ways to Declare the Variable as Constant in C Range of Int in C C Program to find the size of a File FIFO Example in the C Language For loop in C Programming GCD program of two numbers in C GPA Calculator in C How to Calculate Time Complexity in C How to include graphics.h in C How to measure time taken by a function in C How to return a Pointer from a Function in C What is the main in C Addition of Matrix in C Booleans in C C Program for Extended Euclidean algorithms C Program of Fencing the Ground Ceil and Floor in C Compound Interest Program in C Displaying Array in C Distance Vector Routing Protocol Program in c Dos.h Header File in C Language DSA Program in C Explain the two-way selection in C Fee Management System in C File Operations in C Malloc function in C Multiplication Table in C Simple Programs in C Language tolower() Function in C Type Conversion in the C Why does sizeof(x++) not Increment x in C Advantages of Dynamic Memory Allocation in C Armstrong Number in C Assignment Operator Program in C Banker’s Algorithm in C Binary Search in C with Best and Worst Time Complexity Caesar Cipher Program in C Call by Value and Call by Reference in C Conditional Operator in C CRC Program in C Deadlock Detection Program in C Decimal to Binary in C Difference between If Else and Nested If Else in C Difference between Pre-increment and Post-increment in C Difference between Scope and Lifetime in C Evaluation of Arithmetic Expression in C Explain the Increment and Decrement Operators in C Fseek Function in C Functions in C How to Find Square Free Numbers in C Length of an Array Function in C OpenGL in C Projects on C language in 2023 Purpose of a Function Prototype in C Stdio.h in C Two-Dimensional array in C What is String Comparison in C

Merge Sort in C

The merge sort follows the principle of the divide and conquers algorithm. Firstly it divides the input of an array into two halves and then calls itself for the two halves, and it then merges the sorted two halves into one final array, which will be sorted. The merge function is used for merging the two halves.

For example, the merge (array, i, m, r) is the process that assumes that array [i...m] and array[m+1...r] are hence sorted and then merges the two sorted halves or sub-arrays into a final one. Merge sort is one f the popular sorting techniques of all with the worst case time complexity of O(n log n).

Divide and conquer technique:

Using the strategy of divide and conquer, a problem can be divided into many sub problems. Then the solution of each sub problem can be written and later can be combined in order to get the result of the main problem.

For example, consider an array of elements called ‘arr’ needs to be sorted. The array ‘arr’ will be divided into a subproblem which will then be sorted in the subsection of the array starting at the index ‘p’ and ending at ‘r’ denoted as ‘arr [ p… r]’.

  • Divide: if the index ‘q’ is considered to be halfway from ‘p to r’, then the array ‘arr’ can be split into the subarray, which can be divided as ‘arr [p … q]’ and ‘arr [q +1… r].
  • Conquer: while conquering, the programmer has to sort both of the sub-arrays present ‘arr [p … q]’ and ‘arr [q +1… r]. If the base case is not achieved, then it can be further divided into subarrays and sorted.
  • Combine: once the dividing and conquering steps are completed, combining the sorted subarrays is crucial. This is because both the subarrays ‘arr [p … q]’ and ‘arr [q +1… r] which have been sorted are not compiled for the results,, and it creates the sorted array from the original array ‘arr [ p… r]’.

Merge sort algorithm:

For the function “merge (array [], l, r)”:

If r > 1:

1. Find the middle point to divide the array into two halves:

       middle m = l+ (r-l)/2

2. Call mergeSort for the first half:

            Call mergeSort(arr, l, m)

3. All mergeSort for the second half:

            Call mergeSort(arr, m+1, r)

4. Merge the two halves sorted in step 2 and 3:

            Call merge(arr, l, m, r)


void mergesort(int a[],int i,int j);
void merge(int a[],int i1,int j1,int i2,int j2);
int main()
int a[30],n,i;
printf("Enter no of elements:");
printf("Enter array elements:");
printf("\nSorted array is :");
printf("%d ",a[i]);
return 0;
void mergesort(int a[],int i,int j)
int mid;
mergesort(a,i,mid); //left recursion
mergesort(a,mid+1,j); //right recursion
merge(a,i,mid,mid+1,j); //merging of two sorted sub-arrays
void merge(int a[],int i1,int j1,int i2,int j2)
int temp[50]; //array used for merging
int i,j,k;
i=i1; //beginning of the first list
j=i2; //beginning of the second list
while(i<=j1 && j<=j2) //while elements in both lists
while(i<=j1) //copy remaining elements of the first list
while(j<=j2) //copy remaining elements of the second list
//Transfer elements from temp[] back to a[]


Enter no of elements: 6
Enter array elements: 5 4 1 3 7 3 
Sorted array is : 1 3 3 4 5 7 

Time complexity:

Since merge sort is a recursive algorithm, the time complexity can be written as


T (n) = 2T (n/2) + θ(n)

The time complexity of the merge sort algorithm is the same for all the three cases which include best, average, and worst cases = θ (n Log n)

This is because the merge sort always divides the array into two halves and takes linear time to merge two halves.

It has the auxiliary space of O (n).

Applications of the merge sort

  • Merge Sort helps sort linked lists in O(n log n) time. In the case of linked lists, the case is different mainly due to the difference in memory allocation of arrays and linked lists.
  • Unlike arrays, linked list nodes may not be adjacent in memory.
  • Unlike an array, in the linked list, we can insert items in the middle in O(1) extra space and O(1) time. Therefore, the merge operation of merge sort can be implemented without extra space for linked lists.
  • It can be used in the inversion count problem.
  • It can also be made use in external sorting.

Drawbacks of using merge sort:

  • It is slower when compared to other algorithms as it uses the dividing and conquering method. This is only suitable for smaller tasks.
  • Unlike, any other sorting techniques, Merge sort uses an additional space for the memory O (N) for the temporary array while it divides. This space is known as auxiliary space.
  • It always goes through the whole process of divide and conquers even though the array is sorted beforehand.