Difference between revisions of "Chapter 8, exercise 5 answer"
From CompSciWiki
Line 4: | Line 4: | ||
for (j = 0; j < array.length; j++) { | for (j = 0; j < array.length; j++) { | ||
− | for (k = | + | for (k = 0; k < array.length - 1; k++) { |
if (array[k] > array[k + 1]) { | if (array[k] > array[k + 1]) { | ||
temp = array[k]; | temp = array[k]; |
Latest revision as of 15:03, 20 March 2007
public static void sortArray (int[] array) { int j = 0, k = 0, temp = 0; for (j = 0; j < array.length; j++) { for (k = 0; k < array.length - 1; k++) { if (array[k] > array[k + 1]) { temp = array[k]; array[k] = array[k + 1]; array[k + 1] = temp; } } } }