Thanku Sasi .
On Tue, Jul 26, 2011 at 10:49 PM, sasi kumar wrote:
> hi
> > void XYZ(int a[],int b[], int c[])
> > {
> > int i,j,k;
> > i=j=k=0;
> > while((i > {
> > if (a[i] > c[k++]=a[i++];
> > else
> > c[k++]=b[j++];
> >0
> > }
>
> In this case either i value or j value is
hi
> void XYZ(int a[],int b[], int c[])
> {
> int i,j,k;
> i=j=k=0;
> while((i {
> if (a[i] c[k++]=a[i++];
> else
> c[k++]=b[j++];
>0
> }
In this case either i value or j value is incremented at a time
in an iteration . So its impossible that both the conditions (i< n)
and (j
> Which of
Consider the following C-function in which a[n] and b[m] are two
sorted integer arrays and c[n+m] be an other integer array.
void XYZ(int a[],int b[], int c[])
{
int i,j,k;
i=j=k=0;
while((ihttp://groups.google.com/group/algogeeks?hl=en.
C )
On Tue, Jul 26, 2011 at 9:02 PM, Vijay Khandar wrote:
> Consider the following C-function in which a[n] and b[m] are two
> sorted integer arrays and c[n+m] be an other integer array.
>
>
> void XYZ(int a[],int b[], int c[])
> {
> int i,j,k;
> i=j=k=0;
> while((i {
> if (a[i] c[k++]=a[i++];
>
Consider the following C-function in which a[n] and b[m] are two
sorted integer arrays and c[n+m] be an other integer array.
void XYZ(int a[],int b[], int c[])
{
int i,j,k;
i=j=k=0;
while((ihttp://groups.google.com/group/algogeeks?hl=en.
