n o’lchamli massiv berilgan. Foydalanuvchi kiritgan elementni qidirishni chiziqli qidirish usulida amalga oshiring

2 variant
2.2 N o’lchamli massiv berilgan. Foydalanuvchi kiritgan elementni qidirishni chiziqli qidirish usulida amalga oshiring.
#include

int main()

{
int a[20],i,x,n;
printf("NECHTA ELEMENT QIDIRASIZ? ");
scanf("%d",&n);

printf("Massiv elementlarini kiriting :n \n");

for(i=0;iscanf("%d",&a[i]);

printf("Qidirish uchun elementni kiriting:");

scanf("%d",&x);

for(i=0;i
if(a[i]==x)
break;
if(iprintf("Topilgan elementning indeksi %d",i);
else
printf("bunday element yo`q!");
return 0;}

2 variant

3.2 N o’lchamli massiv berilgan. Massiv elementlarini tanlash orqali saralash usulida saralang
#include

int search(int arr[], int N, int x)

{
int i;
for (i = 0; i < N; i++)
if (arr[i] == x)
return i;
return -1;
}
int main(void)
{
int arr[] = { 2, 3, 4, 10, 40, 56, 2003, 23, 15, 45 };
int x = 15;
int N = sizeof(arr) / sizeof(arr[0]);
int result = search(arr, N, x);
(result == -1)
? printf("bu elemant massivda yuq")
: printf("masivdagi elemant indeksi %d", result);
return 0;
}