Code Snippets

Java Source Code

Welcome to Dream.In.Code
	Become a Java Expert! Join 307,145 Java Programmers for FREE! Get instant access to thousands of Java experts, tutorials, code snippets, and more! There are 1,738 people online right now. Registration is fast and FREE... Join Now! Chat LIVE With a Java Expert

Insertion Sort

Sorts an array of integers using the insertion sort algorithm (moving each element to its proper place). More efficient than Bubble Sort.

Submitted By: SPlutard

Actions:

Rating:

Views: 35,232

Language: Java

Last Modified: August 9, 2006

Instructions: The following snippet is only a method - not a full-fledged applicaton, making it easier to add into your own code.

It requires two integer arguments (in this order):
--> The array to be sorted
--> The length of that array

Snippet

/* Snippet: Insert Sort
* Author: SPlutard
*
*Description: Sorts an array of integers using the insertion sort algorithm (moving each element to its proper place).
* More efficient than Bubble Sort.
*/
public static void insertionSort(int[] list, int length) {
int firstOutOfOrder, location, temp;
for(firstOutOfOrder = 1; firstOutOfOrder < length; firstOutOfOrder++) { //Starts at second term, goes until the end of the array.
if(list[firstOutOfOrder] < list[firstOutOfOrder - 1]) { //If the two are out of order, we move the element to its rightful place.
temp = list[firstOutOfOrder];
location = firstOutOfOrder;
do { //Keep moving down the array until we find exactly where it's supposed to go.
list[location] = list[location-1];
location--;
}
while (location > 0 && list[location-1] > temp);
list[location] = temp;
}
}
}

Copy & Paste

/* Snippet: Insert Sort
 * Author: SPlutard
 *
 *Description: Sorts an array of integers using the insertion sort algorithm (moving each element to its proper place). 
 *              More efficient than Bubble Sort.
 */

public static void insertionSort(int[] list, int length) {
    int firstOutOfOrder, location, temp;
    
    for(firstOutOfOrder = 1; firstOutOfOrder < length; firstOutOfOrder++) { //Starts at second term, goes until the end of the array.
        if(list[firstOutOfOrder] < list[firstOutOfOrder - 1]) { //If the two are out of order, we move the element to its rightful place.
            temp = list[firstOutOfOrder];
            location = firstOutOfOrder;
            
            do { //Keep moving down the array until we find exactly where it's supposed to go.
                list[location] = list[location-1];
                location--;
            }
            while (location > 0 && list[location-1] > temp);
            
            list[location] = temp;
        }
    }
}

Comments
chachejave 2008-04-14 14:05:02
I'm a noobe. I like the idea of the efficiency of this snippet but what does the statement under "do" accomplish, specifically "location--"?
Amelody 2008-07-11 21:53:14
nice tip!!!
aforlion 2009-02-20 08:43:02
I like this particular sort method. but how do I sort Strings instead of just int?
SooUoo 2009-10-29 15:18:38
you change string into integer by using "Integer.parseInt(args[])"