Question

Problem 2. Write a code implementing Insertion-Sort algorithm.

Preferably java

Answer 1

`Hey,

Note: If you have any queries related to the answer please do comment. I would be very happy to resolve all your queries.

public class Main {
/*Function to sort array using insertion sort*/
public static void sort(int arr[])
{
int n = arr.length;
for (int i = 1; i < n; ++i) {
int key = arr[i];
int j = i - 1;
  
/* Move elements of arr[0..i-1], that are
greater than key, to one position ahead
of their current position */
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = key;
}
}
  
/* A utility function to print array of size n*/
public static void printArray(int arr[])
{
int n = arr.length;
for (int i = 0; i < n; ++i)
System.out.print(arr[i] + " ");
  
System.out.println();
}
  
// Driver method
public static void main(String args[])
{
int arr[] = { 12, 11, 13, 5, 6 };
  
sort(arr);
  
printArray(arr);
}
}

Chrome File Edit View History Bookmarks People Tab Window Help 62%O Sun 4:14 AM Q M Inbox - gurkaranpreet.sing X C Computer Science questio X </> Online Java Compiler - On Х C My Q&A | Chegg.com + ► SUIT PUNJABI : JASS X € + c tutorialspoint.com/compile_java_online.php LO codingground Compile and Execute Java Online (JDK 1.8.0) Fork & Project - Edit Setting & Login SIMPLY EASY CODING L.l. Result BOL Sjavac Main.java $java -Xmx128M -Xms 16M Main { 5 6 11 12 13 that are on ahead 6.Execute > Share Source File STDIN 1- public class Main { 2 public static void sort(int arr[]) 4 int n = arr.length; 6 for (int i = 1; i < n; ++i) { 7 int key = arr[i]; 8 int j = i ; 9 10 Move elements of arrio. 11 greater thanked to one POS 12 13 while (j >= 0 && arr[j] > key) { 14 arr(j + 1] = arr[j]; 15 j = j - 1; 16 17 arr(j + 1] = key; 18 19 20 21 22 public static void printArray(int arr[]) 23 24 int n = arr.length; 25 for (int i = 0; i < n; ++i) 26 System.out.print(arr[i] "); 27 28 System.out.println(); 29 30 31 32 public static void main(String args[]) 33 { 34 int arri } بها { ma tv

Kindly revert for any queries

Thanks.