InsertionSort

InsertionSort - /double array = new double[10/array[0 = 4.6...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
public class InsertionSort { public static void insertionSort(double[] a) { for (int pass = 1; pass < a.length; pass++) { int index = pass; { double temp = a[index-1]; a[index-1] = a[index]; a[index] = temp; index--; } } } public static void main(String[] args)
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: { //double array = new double[10]; //array[0] = 4.6; double array = { 9.4, 4.7, 8.9, 2.4, 8.4 }; insertionSort(array); for (int i = 0; i < array.length; i++) { System.out.println(array[i]); } } } //Double.NaN...
View Full Document

This note was uploaded on 11/03/2009 for the course CS 01-111 taught by Professor Pradiphari during the Fall '09 term at Rutgers.

Ask a homework question - tutors are online