Basic linear search function in C++ (static array)

seqSearch.cpp

#include <iostream>
#include <iomanip>
#include <string>
#include <fstream>
#include <cmath>
#include <cstring>

using namespace std;
const int ARRAY_SIZE = 7;

int seqSearch(const int list[], int listLength, int searchItem);

int main()
{
	int arr[] = { 35, 12, 27, 18, 45, 16, 38 };
	int searchNum;
	int searchResult;

	cout << "Enter a number to you think is in this array: ";
	cin >> searchNum;

	searchResult = seqSearch(arr, ARRAY_SIZE, searchNum);

	if (searchResult != -1) {
		cout << "The result " << searchNum << " is located at index #" << searchResult << endl;
	}
	else {
		cout << "The " << searchNum << " is not in the list." << endl;
	}

	return 0;
}

int seqSearch(const int list[], int listLength, int searchItem) {
	int pos;
	bool found = false;

	pos = 0;

	while (pos < listLength && !found) {
		if (list[pos] == searchItem) {
			found = true;
		}
		else {
			pos++;
		}
	}

	if (found) {
		return pos;
	}
	else {
		return -1;
	}
}