Quantcast
Channel: CodeChef Discuss - latest questions
Viewing all articles
Browse latest Browse all 39796

ups and downs ..WHAT WAS MY MISTAKE

$
0
0

include<iostream>

using namespace std; void merge(long long int *A,int p,int q,int r) {

int n1,n2,i,j,L[1000],R[1000];
n1=q-p+1;
n2=r-q;
for(i=1;i<=n1;++i)
{
    L[i]=A[p+i-1];
}
for(i=1;i<=n2;++i)
{

    R[i]=A[q+i];
}
L[n1+1]=100006;
R[n2+1]=100006;
i=1;
j=1;
for(int k=p;k<=r;++k)
{
    if(L[i]<=R[j])
    {
        A[k]=L[i];
        ++i;
    }
    else
    {
        A[k]=R[j];
        ++j;
    }
}

}

void mergesort(long long int *A,int p,int r) { int q;
if(p<r) {

    q=(p+r)/2;
    mergesort(A,p,q);
    mergesort(A,q+1,r);
    merge(A,p,q,r);
}

} int main() { long long int array[100006],t,n,i,j; cin>>t; while(t--) { cin>>n; for( i=1;i<=n;++i) { cin>>array[i]; } mergesort(array,1,n); for(i=1,j=n;i<=j;++i,--j) { if(i==j) { cout<<array[i]; } else {

            cout<<array[i]<<" "<<array[j]<<" ";
        }
    }
    cout<<"\n";
}
return 0;

}


Viewing all articles
Browse latest Browse all 39796

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>