//
//	CPE 221 C++ Example
//	
//	This program merges two sorted lists into one list.
//
#include <iostream>
#include <iomanip>

using namespace std;

int main()
{
  int size1 = 15;
  int size2 = 25;
  int size3 = 40;
  int data1[15];
  //= {-20000, -3000, -386, -122, -44, -11, 1, 59, 267, 999, 1111, 2929, 3333, 3333, 11111};
  int data2[25];
  //{-30000, -19555, -12222, -8888, -555, -234, -88, 1, 3, 45, 88, 111, 192, 192, 212, 333, 6666, 10000, 11000, 15622, 22312, 33333, 54321, 88976, 100022};
  int data3[40];
  int index1 = 0;
  int index2 = 0;
  int index3 = 0;
  
  /*while ((index1 < size1) && (index2 < size2))
  {
    if (array1[index1] < array2[index2])
    {
      array3[index3] = array1[index1];
      index1++;
    }
    else
    {
      array3[index3] = array2[index2];
      index2++;
    }
    index3++;
  }*/
  //cout << "Is it ok here?";
  //while (index1 < size1)
  //{
  //  array3[index3] = array1[index1];
  //  index3++;
  //  index1++;
  //}
  //while (index2 < size2)
  //{
  //  array3[index3] = array2[index2];
  //  index3++;
  //  index2++;
  //}
  //for (index3 = 0; index3 < size3; index3++)
  //  cout << array3[index3] << " ";
  return 0;
}