Anonymous user
Sorting algorithms/Insertion sort: Difference between revisions
Sorting algorithms/Insertion sort (view source)
Revision as of 20:39, 14 November 2007
, 16 years agoAdded Java example.
(Created page from Help:Request a new programming task.) |
(Added Java example.) |
||
Line 10:
j = j-1
A[j+1] = value
Writing the algorithm for integers will suffice.
=={{header|Java}}==
public static void insertSort(int[] A){
for(int i = 1; i < A.length; i++){
int value = A[i];
int j = i - 1;
while(j >= 0 && A[j] > value){
A[j + 1] = A[j];
j = j - 1;
}
A[j + 1] = value;
}
}
| |||