Merge Sort Implementation

[Mukku27]

Merge Sort Implementation

This commit adds an implementation of the Merge Sort algorithm.

1.Merge Sort is a divide-and-conquer algorithm that recursively splits the array into two halves, sorts each half, and then merges the sorted halves back together.
2.The algorithm first divides the array into smaller subarrays by finding the midpoint and recursively calling mergeSort() on the left and right halves.
3.The merge() function is used to merge two sorted subarrays by comparing the elements from both and copying the smaller element into the original array.
4.This implementation has a time complexity of O(n log n), where n is the number of elements in the array, making it efficient for large datasets.

[panditakshay402]

✔

[Mukku27]

@panditakshay402 you have approved the PR if everything looks good, I would appreciate it if you could merge the PR.