Comments on Technical Interview Questions, Answers, and Tips: Merge 2 Sorted Arrays (one has empty slots)

// Both the above code doesn't work and produc...

2011-06-22T00:47:26.026-07:00

// Both the above code doesn't work and produces invalid result. Here is the correct code and works perfectly for the above example.

void mergeArray(int[] A1, int[] A2)
{
int count = FindCount(A2); // get the count of full slots
int i = A1.Length - 1;
int j = count - 1;
int k = A2.Length - 1;<

void Merge(int[] A1, int[] A2) { int count = Fi...

2010-09-08T05:29:15.840-07:00

void Merge(int[] A1, int[] A2)
{
int count = FindCount(A2); // get the count of full slots
int i = A1.Length - 1;
int j = count - 1;
int k = A2.Length - 1;

for(;k>=0;k--)
{
if(A1[i] > A2[j] || j < 0)
{
A2[k] =A1[i];
i--;
if(i<0)
break;
}<

void merge(int[] A1, int[] A2) { int count = fi...

2010-08-12T08:09:56.498-07:00

void merge(int[] A1, int[] A2)
{
int count = findCount(A2); // get the count of full slots
int i = A1.length - 1;
int j = count - 1;
int k = A2.length - 1;

for(;k>=0;k--)
{
if((i >= 0 && j >= 0 && A1[i] > A2[j]) || j < 0)
{
A2[k] =A1[i];
i--;
}

Have you tried running this code ? I think it will...

2010-01-21T18:37:37.437-08:00

Have you tried running this code ? I think it will give ArrayIndexOutofBounds (or similar exception) on line:
if(A1[i] > A2[j] || j < 0)

thanks for the feedback. I revised the problem des...

2009-10-26T19:47:00.885-07:00

thanks for the feedback. I revised the problem description and the solution.

i think there is a mistake in the index for smalle...

2009-10-25T17:08:53.322-07:00

i think there is a mistake in the index for smaller, it should be j instead of i.