86) Write a program for insertion sort in ascending order: import java.util.Scanner; public class InsertionSort { /* Insertion Sort function */ public static void sort( int arr[] ) { int N = arr.length; int i, j, temp; for (i = 1; i< N; i++) { j = i; temp = arr[i]; while (j > 0 && temp < arr[j-1]) { arr[j] = arr[j-1]; j = j-1; } arr[j] = temp; } } /* Main method */ public static void main(String args[]) { Scanner input = new Scanner(System.in); System.out.println(******** Insertion Sort Test ********); int n, i; /* Accept number of elements */ System.out.print(Enter number of integer elements: ); n = input.nextInt(); /* Create integer array on n elements */ int arr[] = new int[n]; /* Accept elements */ System.out.println(Enter + n + integer elements); for (i = 0; i < n; i++) arr[i] = input.nextInt(); /* Call method sort */ sort(arr); /* Print sorted Array */ System.out.println(Elements after sorting); for (i = 0; i < n; i++) System.out.print(arr[i]+ ); System.out.println(); } } Output: ******** Insertion Sort Test ******** Enter number of integer elements: 5 Enter 5 integer elements 15 21 36 11 63 Elements after sorting 11 15 21 36 63
Posted on: Mon, 08 Sep 2014 13:33:25 +0000
Trending Topics
Recently Viewed Topics
© 2015