Okay the sequential search is easier than the recursive and iterative binary searches, I figure I would include it to wrap up searches for now. For the sequential search, you loop through an array (or whatever data structure you are using) checking each position for the search value. Works just as well on sorted array lists as it does on unsorted array lists!

Good luck, let me know if you have questions or improvements!

int sizeOfArray; //size of array, way easy to store it than calculate it everytime int* array; //contains a list of integers that you will search through bool sequentialFind(int number){ for(int i = 0; i < sizeOfArray; i++){ if (array[i] == number){ return true; } } return false; }