Merge pull request #292 from MkshSahani/patch-1

update merge_sort.cpp

Author: probot-auto-merge[bot]

Searching and Sorting/Merge sort/CPP/merge_sort.cpp

@@ -53,19 +53,24 @@ void Merge(int *a, int low, int high, int mid)
 }
 
 // A function to split array into two parts.
+
+/**
+	another way to doing it by recursion 
+	contain the base case if low goes higher or equal to high 
+	than stop adding more activitaion record of copy of function to stack, and 
+	start giving the result to parent call.
+*/
+
 void MergeSort(int *a, int low, int high)
 {
-	int mid;
-	if (low < high)
+	if(low >= high)
 	{
-		mid=(low+high)/2;
-		// Split the data into two half.
-		MergeSort(a, low, mid);
-		MergeSort(a, mid+1, high);
- 
-		// Merge them to get sorted output.
-		Merge(a, low, high, mid);
+		return;
 	}
+	int mid = (low + high);
+	MergeSort(a, low, mid);
+	MergeSort(a, mid + 1, high);
+	Merge(a, low, high, mid);
 }
 
 int main()
@@ -89,4 +94,4 @@ int main()
         cout<<"->"<<arr[i];
     cout<<endl;
 	return 0;
-}
+}