Please visit the following links:

Java bubble sort

Java Heap Sort

Java Insertion Sort

Java Merge Sort

Java Selection Sort

Java Quick Sort

hello Mr.Annonymous thanks for ur valuable time and suggestion. but i wanna know abt internal sorting mechanism. say about Collections.Sort() & Arrays.Sort() that uses Merge Sort internally.

import java.util.*;
class SortList 
{
    public static void main(String[] args) 
    {
        ArrayList<String> list=new ArrayList<String>();
        list.add("D");
        list.add("B");
        list.add("A");
        list.add("E");
        list.add("C");

    Object arr[] = list.toArray(); 
    Arrays.sort(arr);
    for(int i=0;i<arr.length;i++){
    System.out.println(arr[i].toString());
     }
    }
}

import java.util.*;
class ArraySort{
    public static void sortArray(int arr[]){
    Arrays.sort(arr);
    System.out.println("After Sorting: ");
    for(int i=0;i<arr.length;i++){
    System.out.println(arr[i]);
    }
    }

    public static void main(String[] args) 
    {
        Scanner input=new Scanner(System.in);
        System.out.println("Enter Array Elements: ");
        int array[]=new int[5];
        for(int i=0;i<array.length;i++){
            array[i]=input.nextInt();
        }
        sortArray(array);

    }
}

Please visit the following links:

http://www.roseindia.net/java/java-tips/data/arrays/70sorting.shtml

http://www.roseindia.net/java/example/java/util/SortingCollection.shtml