GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — java-basics/java-programs/InsertionSort.java at master · learning-zone/java-basics Expand file tree/ Copy pathInsertionSort.javaMore file actions 33 lines (31 loc) · 679 Bytes / Copy pathInsertionSort.javaFile metadata and controls33 lines (31 loc) · 679 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 package misc; /** * Steps:- Insertion sort algorithm builds the final sorted array one item at a * time. * Best Case:- n * Average Case:- n^{2} * Worst Case:- n^{2} * */ public class InsertionSort { public static int[] doInerstionSort(int[] input) { int tmp = 0; for (int i = 1; i < input.length; i++) { for (int j = i; j > 0; j--) { if (input[j] < input[j - 1]) { tmp = input[j]; input[j] = input[j - 1]; input[j - 1] = tmp; } } } return input; } public static void main(String[] args) { int[] arr = { 10, 34, 2, 56, 42 }; int[] result = doInerstionSort(arr); for (int i : result) { System.out.print(i + ", "); } } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |