Added the code of Merge Sort, Selection Sort and Bubble Sort

[KunjMaheshwari]

Resolved Issue #108

MergeSort Algorithm - Merge sort is a sorting algorithm that follows the divide and conquer approach. It works by recursively dividing the input array into smaller subarrays and sorting those subarrays then merging them back together to obtain the sorted array.
Time complexity of this Algorithm is O(nlogn)

SelectionSort Algorithm - Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.
Time complexity of this Algorithm is O(N^2)

BubbleSort Algorithm - Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.
Time complexity of this Algorithm is O(N^2)

[KunjMaheshwari]

I’ve resolved issue #108 in my pull request, and this is my first contribution to open source. I would greatly appreciate your review and consideration for merging it. Thank you!