Instructions

Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm.

Use either the function bubbleSort or insertionSort to sort the list before the search.

Your program should prompt the user to enter $10$ digits and then prompt the user to enter a digit to search.

If the list contains this digit, output its position to the console: $\text{'}\text{'}\text{'}\text{'}$ x is found at position y $\text{'}\text{'}\text{'}\text{'}$

If the digit is not contained in the list, output the following: $\text{'}\text{'}\text{'}\text{'}$ x is not in the list $\text{'}\text{'}\text{'}\text{'}$