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_Learning/18_Basic_Sorting_Algorithm/InsertionSort.java at main · TORRYNN/Java_Learning Expand file tree/ Copy pathInsertionSort.javaMore file actions 32 lines (27 loc) · 777 Bytes / Copy pathInsertionSort.javaFile metadata and controls32 lines (27 loc) · 777 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 public class InsertionSort { public static int[] Isort(int arr[]) { for (int i = 0; i < arr.length; i++) { int j = i; while (j > 0 && arr[j - 1] > arr[j]) { int temp = arr[j - 1]; arr[j - 1] = arr[j]; arr[j] = temp; j--; } } return arr; // Time Complexity: BestCase=O(n) Average/Worst Case=O(n2) // Space Complexity: O(1) } public static void main(String[] args) { int ar[] = { 5, 4, 1, 3, 2 }; for (int num : ar) { System.out.print(num + " "); } System.out.println(); Isort(ar); for (int num : ar) { System.out.print(num + " "); } } } |
| 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. |