main()
{
int a[100];
int i,j,N;
printf("enter the number of elements: ");
scanf("%d",&N);
for(i=0;i<N;i++)
scanf("%d",a[i]);
if(N%2) j = N/2+1;
else j = N/2;
i =1;
while(j<N)
{
swap(&a[i],&a[j]);
i+=2;
j+=2;
}
if(N%2){
inv_mergesort(a,0,N/2);//sort the array in descending order
mergesort(a,N/2+1,N-1);
}
else{
inv_mergesort(a,0,N/2-1);//sort the array in descending order
mergesort(a,N/2,N-1);
}
for(i=0;i<N;i++)
printf("%d",a[i]);
}
I hope the code doesn't contain any bugs...:P :P
On 5/28/11, srajan dongre <[email protected]> wrote:
> wat about insertion sort (with some limited conditions obviously ) ??
>
> On Sat, May 28, 2011 at 12:56 AM, Piyush Sinha
> <[email protected]>wrote:
>
>> will it be given that the number of elements is always even??
>>
>> On 5/28/11, ross <[email protected]> wrote:
>> > Hi all,
>> >
>> > Sort all elements in odd indices of an array in ascending order and
>> > even indices in descending order.
>> > Finally, rearrange so that all even indexed elements come first.
>> >
>> > eg:
>> >
>> > input – 7 2 6 4 8 3 1
>> >
>> > even indexed : 7 6 8 1 => sort 8 7 6 1
>> > odd indexed: 2 4 3 => sort 2 3 4
>> >
>> > output – 8 7 6 1 2 3 4
>> >
>> > What could be the best algo to solve it?
>> > Is it possible to arrive at the output using only O(1) extra space?
>> >
>> > --
>> > You received this message because you are subscribed to the Google
>> > Groups
>> > "Algorithm Geeks" group.
>> > To post to this group, send email to [email protected].
>> > To unsubscribe from this group, send email to
>> > [email protected].
>> > For more options, visit this group at
>> > http://groups.google.com/group/algogeeks?hl=en.
>> >
>> >
>>
>>
>> --
>> *Piyush Sinha*
>> *IIIT, Allahabad*
>> *+91-8792136657*
>> *+91-7483122727*
>> *https://www.facebook.com/profile.php?id=100000655377926 *
>>
>> --
>> You received this message because you are subscribed to the Google Groups
>> "Algorithm Geeks" group.
>> To post to this group, send email to [email protected].
>> To unsubscribe from this group, send email to
>> [email protected].
>> For more options, visit this group at
>> http://groups.google.com/group/algogeeks?hl=en.
>>
>>
>
>
> --
> ------
>
> Srajan Dongre
> ||nd year CSI (dual degree)
> Indian Institute of Technology , Roorkee
> Uttrakhand , India
> pin code--247667
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to [email protected].
> To unsubscribe from this group, send email to
> [email protected].
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=100000655377926 *
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
