Insertion sort algorithms || logical Question || Interview Question
==================================================================
/* Inserction in Arrays
--------------------------------------------------------------
1.first you have a one take one Arrays And store the element in the Arrays
2.you have to applay the logic to sort the arrays Assending array
3.so start thre loop of the Array 1 to lsat
*/
import java.util.Scanner;
class InsertionArrays
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
//Take input how much element do you want to store in the Arrays
System.out.println("Enter How much Number do you want to insert::");
int n=sc.nextInt();
//create Arrays based on the N values
int a[]=new int[n];
//Display the Message how much number user have to insert
System.out.println("Enter "+n+" element:");
//take all the user element in through the loop
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
//so now you have a everything
//Applay the logic to sort the all element in the arrays
int key,j;
for(int i=1;i<n;i++){
//take one temp values to store the second element
key=a[i];
//every time you have to compare i less than index
j=i-1;
//check the condition to j values is less than 0 or not and also compare the values
while(j>=0&&a[j]>key){
//if condition is true than insert the vlues
a[j+1]=a[j];
j=j-1;
}
//finally key will inset
a[j+1]=key;
}
//printing the all element on console
for(int i=0;i<n;i++){
System.out.print(a[i]+" ");
}
}
}
====================================
Output:
Comments
Post a Comment