This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Merge Sort | |
1. Declare left and right variable , where left = 0 , right = n-1. | |
2. find mid , which is left+right/2 | |
3. Call recursively mergeSort on (left,mid) and (mid+1,rear) | |
4. 3rd step will continue till left<right. | |
5. Then we will call merge on the 2 subproblems. | |
*/ |