#include <iostream>
using namespace std;
int main()
{
int personPancake[10];
int small, big;
for (int c = 0; c < 10; c++)
{
cout << "Enter how many pancakes person " << c + 1 << " ate: ";
cin >> personPancake[c];
}
big = small = personPancake[0];
for (int c = 0; c < 10; c++)
{
if (personPancake[c] > big)
{
big = personPancake[c];
}
if (personPancake[c] < small)
{
small = personPancake[c];
}
}
cout << "Biggest: " << big << endl;
cout << "Smallest: " << small << endl << endl;
}
這是我有atm的代碼,我已經想出了最小和最大的數字,你可以看到。我需要幫助找出具有最大和最小值的元素的索引。我如何找出數組中哪個元素具有最高值?
聲明另外兩個變量big_index和small_index,並將它們初始化爲0.每當更新big的值時,更新big_index的值並將其設置爲c。每當你更新'small'的值時,更新'small_index'的值並將其設置爲'c'。 –
首先,刪除輸入法並使用'pancake [5] = {12,34,56,45,67};''這樣你就不必每次輸入10個數字來測試函數。稍後放回輸入法。 –