printf("\nButun sonni kiriting. \n"); printf("Har bir sonni kiritgandan keyin "); printf(" tugmasini bosing\n");
for (i = 0; i < SIZE; i++) {
printf("a[%i] ->",i+1); scanf("%i", &a[i]);
if (a[i] != 0) n++; }
printf("Massivning nolga teng bo'lmagan elementlari %i ta.\n", n); printf("\nIshni tugatish uchun ni bosing");
getch(); return 0; }
Dasturnatijasi:
2. Bir o‟lchamli 5 ta elementdan iborat bo‟lgan massivning eng kichik elementini aniqlash dasturini tuzing.
Dasturkodi:
int a[HB]; int min; int i;
printf("Massivning eng kichik elementini topish\n"); printf("Massiv elementlarini bir qatorga kiriting,\n");
printf("%i ta butun sonni kiriting va ni bosing\n", HB) ; printf("-> ") ;
for (i = 0; i < HB; i++) scanf("%i",&a[i]); min =0;
for (i = 1; i < HB; i++)
if (a[i] < a[min]) min = i; printf("Massivning eng kichik elementi: "); printf("a[%i]=%i ", min+1, a[min]);
printf("\nIshni tugatish uchun ni bosing"); getch();
return 0; }