#include <stdio.h>
#include <conio.h>
int v[20];
int n,i,k,gata,gasit,ind,aux;
void sortv()
{
do
  {  ind=0;
     for(i=1;i<=n-1;i++)
	  {if (v[i]>v[i+1]) {
			aux=v[i];
			v[i]=v[i+1];
			v[i+1]=aux;
			ind=1;
			  }
	  }
  } while (ind!=0);
}
void afisare()
{
for(i=1;i<=n;i++)
  printf("v[%d]=%d  ",i,v[i]);
printf("\n");
}

void main(void)
{
clrscr();
printf("n="); scanf("%d",&n);
printf("introduceti elementele vectorului\n");
for (i=1;i<=n;i++)
   {
     printf("v[%d]=",i);
     scanf("%d",&v[i]);
   }
sortv();
printf("vectorul sortat \n");
afisare();
printf("nr cautat in sir =");
scanf("%d",&k);
gata=0;
gasit=0;
i=1;
while (i<=n && !gata)
  {
    if (v[i]==k) {
		gata=1;
		gasit=1;
	       }
       else if (v[i]>k) gata=1;
		else i++;
   }
if (i>n || !gasit)  printf("Numarul cautat nu se afla in sir");
    else  printf("Numarul cautat se afla in sir");
getch();
}