merge sort implementation - O(nlogn)

Author: NirmalSilwal

CodingBlocks Training/Day14/mergeSort.java

@@ -7,20 +7,20 @@ public static void main(String[] args) {
 		int[] arr = { 80, 10, 50, 30, 60, 40, 20, 70 };
 
 		int start = 0, end = arr.length - 1;
-		int[] sorted = quickSort(arr, start, end);
+		int[] sorted = mergeSorting(arr, start, end);
 		display(sorted); // 10 20 30 40 50 60 70 80
 
 	}
 
-	public static int[] quickSort(int[] arr, int start, int end) {
+	public static int[] mergeSorting(int[] arr, int start, int end) {
 		if (start == end) {
 			int[] baseResult = new int[1];
 			baseResult[0] = arr[start];
 			return baseResult;
 		}
 		int mid = (start + end) / 2;
-		int[] firstHalf = quickSort(arr, start, mid);
-		int[] secondHalf = quickSort(arr, mid + 1, end);
+		int[] firstHalf = mergeSorting(arr, start, mid);
+		int[] secondHalf = mergeSorting(arr, mid + 1, end);
 		int[] sortedArray = mergeArray(firstHalf, secondHalf);
 
 		return sortedArray;