Hayotiy misollar
Hayotiy misol
Massivlardan foydalanishning amaliy misolini ko‘rsatish uchun turli yoshlarning o‘rtacha qiymatini hisoblaydigan dastur yaratamiz:
Misol
// An array storing different ages
int ages[] = {20, 22, 18, 35, 48, 26, 87, 70};
float avg, sum = 0;
int i;
// Get the length of the array
int length = sizeof(ages) / sizeof(ages[0]);
// Loop through the elements of the array
for (i = 0; i < length; i++) {
sum += ages[i];
}
// Calculate the average by dividing the sum by the length
avg = sum / length;
// Print the average
printf("The average age is: %.2f", avg);
O‘zingiz sinab ko‘ring »
Bu misolda esa turli yoshlar orasidan eng kichigini topadigan dastur yaratamiz:
Misol
// An array storing different ages
int ages[] = {20, 22, 18, 35, 48, 26, 87, 70};
int i;
// Get the length of the array
int length = sizeof(ages) / sizeof(ages[0]);
// Create a variable and assign the first array element of ages to it
int lowestAge = ages[0];
// Loop through the elements of the ages array to find the lowest age
for (i = 0; i < length; i++) {
if (lowestAge > ages[i]) {
lowestAge = ages[i];
}
}
O‘zingiz sinab ko‘ring »
Bu misolda sonlar ro‘yxatini aylanib chiqamiz. Manfiy qiymatlarni o‘tkazib yuboramiz, lekin nol uchrasa, siklni butunlay to‘xtatamiz:
Misol
int myNumbers[] = {3, -1, 7, 0, 9};
int length = sizeof(myNumbers) / sizeof(myNumbers[0]);
int i;
for (i = 0; i < length; i++) {
if (myNumbers[i] < 0) {
continue; // skip negative numbers
}
if (myNumbers[i] == 0) {
break; // stop loop when zero is found
}
printf("%d\n", myNumbers[i]);
}W3Schools Pathfinder
Yutuqlaringizni kuzating – bu bepul!