From 18cc799b8d5019df7d50a647c4e352a174879d0a Mon Sep 17 00:00:00 2001 From: Sarvadnya Awaghad <111975266+Sarvadnyaawaghad150503@users.noreply.github.com> Date: Sat, 7 Oct 2023 13:42:59 +0530 Subject: [PATCH] Create InsertionSort.java --- Java/Arrays/InsertionSort.java | 29 +++++++++++++++++++++++++++++ 1 file changed, 29 insertions(+) create mode 100644 Java/Arrays/InsertionSort.java diff --git a/Java/Arrays/InsertionSort.java b/Java/Arrays/InsertionSort.java new file mode 100644 index 00000000..e2c1f7ae --- /dev/null +++ b/Java/Arrays/InsertionSort.java @@ -0,0 +1,29 @@ +package Sorting_techniques; + +import java.util.Arrays; + + + +public class insertionSort { + public static void main(String[] args) { + int nums[] = {23, 112,2,5,-1, -13, 45,78 ,-2, 64,53,25,}; + InsertionSort(nums); + System.out.println(Arrays.toString(nums)); + } +//in insertion sort it sorted in parts, first 1&2, then 1,2,&3, then 1,2,3,&4 like this + static void InsertionSort(int [] arr){ + for (int i=0; i 0; j--){ + + if(arr[j] < arr[j-1] ){ + swap(arr, j, j-1); + } + } + } + } + static void swap(int []arr,int first, int second){ + int temp = arr[first]; + arr [first] = arr[second]; + arr[second] = temp; + } +}