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/Programs/InsertionSort.java at main · am-opensource-learner-void/Java Expand file tree/ Copy pathInsertionSort.javaMore file actions 30 lines (29 loc) · 831 Bytes / Copy pathInsertionSort.javaFile metadata and controls30 lines (29 loc) · 831 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 //program that demonstrate insertion sort algorithm import java.util.Arrays; public class Main { //Driver Function public static void main(String[] args) { int[] arr = {7, 9, 2, 4, 10}; insertionSort(arr); System.out.println(Arrays.toString(arr)); } //Insertion Sort Algorithm static void insertionSort(int[] arr) { for (int i = 0; i < arr.length - 1; i++) { for (int j = i+1; j > 0; j--) { if (arr[j] < arr[j-1]) { swap(arr, j, j-1); } else { break; } } } } //Swapping Algorithm static void swap(int[] arr, int first, int second) { int temp = arr[first]; arr[first] = arr[second]; arr[second] = temp; } } |
| 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. |