Java Applets Centre

Merge Sort

Description
This applet demonstrates the working of the Merge Sort algorithm.

Create: Type a value between 4 and 100 in the text field, and click "Create" to create a randomly generated array of the specified size.

Sort: Displays the process of sorting the array using Merge Sort algorithm. The applet uses a fast display mode, if the input value is greater than 20.

Code

void mergeSort(int first, int last){
int mid;
if(first==last) return;
mid=(first+last)/2;
mergeSort(first,mid);
mergeSort(mid+1,last);
mergeArray(first,mid,last);
}

Data Structures and Algorithms
Java Applets Centre

R. Mukundan
Department of Computer Science
University of Canterbury
Private Bag 4800, Christchurch
New Zealand.