Write a program to sort the elements in odd positions in descending order and elements in

ascending order

Eg 1: Input: 13,2 4,15,12,10,5

        Output: 13,2,12,10,5,15,4

Eg 2: Input: 1,2,3,4,5,6,7,8,9

        Output: 9,2,7,4,5,6,3,8,1 

CODE

#include<conio.h>
#include<string.h>
void main()
{
int i,n,t,a[100];

scanf("%d",&n);

for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}


for(i=0;i<n;i+=2)
{
if(i%2==0)
{
if((a[i]<a[i+2])&&((i+2)<n))
{
t=a[i];
a[i]=a[i+2];

a[i+2]=t;
}
}
else
{
if((a[i]>a[i+2])&&((i+2)<n))
{
t=a[i];
a[i]=a[i+2];
a[i+2]=t;
}
}
}
for(i=0;i<n;i++)
{
printf("\t%d",a[i]);
}


}



 Find if a String2 is substring of String1. If it is, return the index of the first occurrence. else return -1.

Eg 1:Input:
        String 1: test123string
         String 2: 123
        Output: 4
Eg 2: Input:
        String 1: testing12
        String 2: 1234 
        Output: -1

#include<conio.h>
#include<string.h>
void main()
{
int i,j=0,r=0,m,n;
char a[100],b[100];
scanf("%d,%d",&n,&m);

gets(a);
gets(b);

n=strlen(a);
m=strlen(b);


for(i=0;i<n;i++)
{
if(a[i]==b[j])
{
r=i;
i++;
for(j=1;j<m;j++)
{
if(a[i]==b[j])
{
i++;
}
else
{
r=-1;
j=m;
}
}
}
else
{
if(r==0)
{
r=-1;
}
}

j=0;

}
printf("%d",r);


}