/ Published in: Java

Expand |
Embed | Plain Text
int i; int array[] = {12,9,4,99,120,1,3,10}; for(i = 0; i < array.length; i++) mergeSort_srt(array,0, array.length-1); for(i = 0; i <array.length; i++) } public static void mergeSort_srt(int array[],int lo, int n){ int low = lo; int high = n; if (low >= high) { return; } int middle = (low + high) / 2; mergeSort_srt(array, low, middle); mergeSort_srt(array, middle + 1, high); int end_low = middle; int start_high = middle + 1; while ((lo <= end_low) && (start_high <= high)) { if (array[low] < array[start_high]) { low++; } else { int Temp = array[start_high]; for (int k = start_high- 1; k >= low; k--) { array[k+1] = array[k]; } array[low] = Temp; low++; end_low++; start_high++; } } }
You need to login to post a comment.