Skip to content

Instantly share code, notes, and snippets.

@cocodrips
cocodrips / MergeSort.java
Created July 5, 2013 21:27
mergeSort in Java
void mergeSort(int[] array, int low, int high){
if(low < high){
int middle = (low + high) / 2;
mergeSort(array, low, middle);
mergeSort(array, middle+1, high);
merge(array, low, middle, high);
}
}
void merge(int[] array, int low, int middle, int high){