Java Insertion Sort Code

Insertion sorting code by java , the complexity is O(n^2) , this algorithm works fine on small data.

Code:

 
public class InsertionSort {

    public static void main(String a[]) {

        int array[] = {13, 5, -42, 61, 121, 51, 5, 6};
        // Printing the array before sort
        printArray(array);
        for (int i = 1; i < array.length; i++) {
            int j = i;
            int currentElement = array[i];
            while ((j > 0) && (array[j - 1] > currentElement)) {
                array[j] = array[j - 1];
                j--;
            }
            array[j] = currentElement;
        }

        // Printing the array after sort
        System.out.println();
        printArray(array);


    }

    public static void printArray(int array[]) {
        for (int z = 0; z < array.length; z++) {
            System.out.print(array[z] + "  ");
        }
    }
}
 

_________________
M. S. Rakha, Ph.D.
Queen's University
Canada

Author: DrRakha
Mastermind

Posts: 2715
Have thanks: 74 time

Page 1 of 1

[ 1 post ]

Related Posts to : Java Insertion Sort Code
Insertion Sort (C++) -
list insertion sorting code in c++ -
Bubble Sort Algorithm Java Implementation Code-Sorting Array -
balloon sort algorithm C++ implementation code-sorting array -
Java merge sort example -
bidirectional bubble sort algorithm implementation java -
Sort strings java-Sorting Array of Strings -
GamePLay java code ( please help ) -
Algorithms code in java -
java code for chat -

Topic Tags

Java Algorithms

Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group
All copyrights reserved to codemiles.com 2007-2011
mileX v1.0 designed by codemiles team
Codemiles.com is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to Amazon.com