Question

Write a program that performs one pass of the natural merge algorithm on the two data files provided (merge_1.txt and merge_2.txt) and state which value appears at index 100.

Enter that value to answer this quiz.

File format: a single integer that is the number of values to follow, followed by at least that number of integers. That first integer is not part of the data.

merge_1.txt:

100(number of elements in the list and not part of the count)
350 659 684 484 735 514 723 473 127 747 735 167 482 954 914 173 186 910 819 879 403 543 776 674 796 342 84 197 130 968 296 863 739 6 301 684 542 515 199 310 338 274 3 57 391 411 968 621 901 370 16 136 818 56 28 171 599 331 979 329 919 946 814 88 75 425 691 650 777 374 688 625 315 199 412 536 617 200 938 293 560 623 426 958 991 279 321 389 310 5 500 578 161 356 889 792 685 625 59 971 

merge_2.txt:

100(number of elements in the list and not part of the count)
125 178 578 693 343 271 596 622 840 902 804 17 9 130 191 332 995 245 854 351 545 689 667 339 777 492 565 491 533 716 924 726 174 425 929 787 576 715 528 48 822 429 557 361 597 266 891 799 546 151 16 166 955 870 249 693 924 198 953 434 859 944 466 491 487 639 156 350 815 828 957 284 397 309 974 998 56 952 270 433 695 175 747 910 200 522 94 619 477 258 164 781 591 372 751 677 587 877 700 161 

"Advance java"

Answer 1

======================================

Program Merge.java

======================================

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Merge {
   //takes 3 arguments , filename1 , filename2 and position , returns element at that pos within the merged array
   public static int merge(String fname1,String fname2,int pos) {
       File f1 = new File(fname1);
       File f2 = new File(fname2);
       Scanner sc1= null,sc2 =null;
       try {
           sc1 = new Scanner(f1);
           sc2 = new Scanner(f2);
       }
       catch(FileNotFoundException e) {
           e.printStackTrace();
       }
   if(sc1 != null && sc2 != null) {
       int len1 = sc1.nextInt();
       int len2 = sc2.nextInt();
      
       int[] arr1 = new int[len1];
       int[] arr2 = new int[len2];
      
       for(int i=0;i<len1;i++) arr1[i] = sc1.nextInt();
       for(int i=0;i<len2;i++) arr2[i] = sc2.nextInt();
      
       //declare merged array
       int[] merged = new int[len1 + len2];
      
       //merge operation
       int i=0,j=0,k=0;
       while(i<len1 && j < len2) {
           if(arr1[i] < arr2[j]) {
               merged[k] = arr1[i];
               i++;
           }
           else {
               merged[k] = arr2[j];
               j++;
           }
           k++;
       }
       if(i == len1) {
           while(j<len2) {
               merged[k++] = arr2[j++];
           }
       }
       else {
           while(i<len1) {
               merged[k++] = arr1[i++];
           }
       }
       //return element at positon
       return merged[pos];
   }
       return -1;
   }
   public static void main(String[] args) {
//caller function

System.out.println(merge("C:\\Users\\Admin\\Documents\\merge_1.txt","C:\\Users\\Admin\\Documents\\merge_2.txt",3));
   }
}

======================================

Demo:

merge_1.txt : 4 4 7 8 11

merge_2.txt : 4 1 6 9 10

position : 3 ( 0 based indexing)

output: 7

======================================