INSERT TWO SORTED ARRAY IN A SINGLE ARRAY

INSERT TWO SORTED ARRAY IN A SINGLE ARRAY

I/P:

5

1 3 5 7 9

2 4 6 8 10


O/P:

1 2 3 4 5 6 7 8 9 10


PROGRAM:

package Arrays;
import java.util.*;
public class InsertTwoSortedArray {

    public static void toInsert(int iArr[],int iArr2[],int iNum)
    {
        int len=iArr.length+iArr2.length;
        int iArr3[]=new int[len];
        int a=0,i=0,j=0;
       while(i<iNum && j<iNum)
       {
           if(iArr[i]<iArr2[j])
           {
               iArr3[a]=iArr[i];
               i++;
               a++;
           }
           else{
               iArr3[a]=iArr2[j];
               j++;
               a++;
           }

       }
     //  System.out.println(i+" "+j);
       while(i<iNum)
       {
           iArr3[a]=iArr[i];
           i++;
           a++;
       }
       while(j<iNum)
       {
           iArr3[a]=iArr2[j];
           j++;
           a++;
       }
        System.out.println(Arrays.toString(iArr3));
    }
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int iNum=sc.nextInt();
        int iArr[]=new int[iNum];
        int iArr2[]=new int[iNum];
        for(int i=0;i<iNum;i++)
        {
            iArr[i]=sc.nextInt();
        }
        for(int i=0;i<iNum;i++)
        {
            iArr2[i]=sc.nextInt();
        }
        toInsert(iArr,iArr2,iNum);
    }
    
}

// 5
// 1 3 5 7 9
// 2 4 6 8 10

// [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]

Comments

Post a Comment

Popular posts from this blog

PROGRAM TO FIND FACTORIAL OF A NUMBER USING RECURSION

 PROGRAM TO FIND FACTORIAL OF A NUMBER  USING RECURSION  I/P: 3 O/P: 6 SOLUTION: package   N umbers ; import   java . util .*; public   class   Factorial  {      static   int   factorial ( int   n ) {          return  ( n  >  1 )  ?   n  *  factorial ( n - 1 )  :   1 ;        }         public   static   void   main ( String []  args ) {              Scanner   sc = new   Scanner ( System . in );             int   n  =  sc . nextInt ();                          int   result  ...
Read more

PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY

  PROGRAM TO FIND THE COUNT OF PARTICULAR NUMBER IN AN ARRAY I/P: 5 1 0 2 0 0 O/P: 3 This program explains how many zeros present in the zero PROGRAM: import   java . util .*; public   class   ZeroCount  {      public   static   void   main ( String   args [])     {          Scanner   sc = new   Scanner ( System . in );          int   iNum = sc . nextInt ();          int   arr []= new   int [ iNum ];          for ( int   i = 0 ; i < iNum ; i ++)         {              arr [ i ]= sc . nextInt ();         }          int   count = 0 ; ...
Read more

TELEPHONE BOOK USING HASHMAP

  Sample Input 3 sam 99912222 tom 11122222 harry 12299933 sam edward harry Sample Output sam=99912222 Not found harry=12299933 Explanation We add the following    (Key,Value)  pairs to our map so it looks like this: We then process each query and print  key=value  if the queried   is found in the map; otherwise, we print  Not found . Query 0:   sam Sam is one of the keys in our dictionary, so we print  sam=99912222 . Query 1:   edward Edward is not one of the keys in our dictionary, so we print  Not found . Query 2:   harry Harry is one of the keys in our dictionary, so we print  harry=12299933 . SOLUTION: package   H acker R ank_problems . practice_problems ; import   java . util .*; import   java . io .*; public   class   TelephoneBook {      public   static   void   main ( String  [] argh ){          Scanne...
Read more