Question

Can anyone help me with this code? I've never worked with insertion sort and I'm having trouble. I posted the instructions and the included code. Thank you!

Insertion Sort Given an array of integers, sort the array in ascending/descending order by using Insertion sort. Reference: http://www.algolist.net/Algorithms/Sorting/Insertion_sort Input 4368 92157 Where, • First line represents the type of ordering. • Second line represents the size of the array. • Third line represents the array elements. Output 123456789 + Test Case(s)

Answer 1

import java.util.Scanner;

class ProblemSolution {
   public int solution(int[] A, int N) {
       for (int i = 1; i < N; ++i) {
           int key = A[i];
           int j = i - 1;

           /*
           * Move elements of A[0..i-1], that are greater than key, to one position
           * ahead of their current position
           */
           while (j >= 0 && A[j] > key) {
               A[j + 1] = A[j];
               j = j - 1;
           }
           A[j + 1] = key;
       }
       return N;
   }
}

public class DriverMain {
   public static void main(String[] args) {
       Scanner sc = new Scanner(System.in);
       int N = sc.nextInt();
       int A[] = new int[N];
       for (int i = 0; i < N; i++) {
           A[i] = sc.nextInt();
       }
       ProblemSolution problemSolution = new ProblemSolution();
       System.out.println(problemSolution.solution(A, N));
   }
}

<ler tillateu> DriverMallu avd Application C:\Proglalti Flies

Note : Please comment below if you have concerns. I am here to help you

If you like my answer please rate and help me it is very Imp for me