我想做的是：我正在尝试做一个程序来搜索一个数组中的一个特定的int，这个int可能在数组中的许多索引处，我需要打印所有的索引（例如5在数组中出现了两次，所以我想输出两个索引）。这必须使用一个线性搜索算法来完成。
我做了什么：我已经写了一个程序，它可以输出数组中指定的int的索引，但是它只能输出第一次int在数组中的索引。下面是我写的源代码：

// This program performs a linear search on a character array

// Author: Y K

#include <iostream>
using namespace std;

int searchList(int[], int, int); // function prototype 

const int SIZE = 8;

int main()
{
    int nums[SIZE] = {3, 6, -19, 5, 5, 0, -2, 99};
    int found;
    int ch;

    cout << "Enter a number to search for:" << endl;
    cin >> ch;

    found = searchList(nums, SIZE, ch);

    if (found == -1)
        cout << "The number " << ch
             << " was not found in the list" << endl;
    else
        cout << "The number " << ch << " is in the " << found + 1
             << " position of the list" << endl;

    return 0;
}

//*******************************************************************
//  searchList
//
//  task:          This searches an array for a particular value
//  data in:       List of values in an array, the number of
//                 elements in the array, and the value searched for
//                 in the array
//  data returned: Position in the array of the value or -1 if value
//                 not found
//
//*******************************************************************

int searchList(int List[], int numElems, int value)
{
    for (int count = 0; count <= numElems; count++)
    {
        if (List[count] == value)
            return count;
    }

    return -1;  // if the value is not found, -1 is returned
}