The _________ search algorithm steps sequentially through an array, comparing each item with the search value.

Question: Explain the step-by-step process of the Linear Search Algorithm to find an element in an array. Answer: The Linear Search Algorithm follows these steps to find an element in an array: 1. Understand the basics: The algorithm sequentially goes through an array, comparing each element with the search value. If the search value is found, the algorithm returns its index, else, it returns -1. 2. Initialize the array and search value: Create an array with elements and assign a value to the search variable that you want to find in the array. 3. Iterate through the array: Loop through each element in the array, one by one, starting from the first element to the last element. 4. Compare each element with the search value: During each iteration, compare the current element of the array with the search value to check for a match. 5. Return the result: If the search value is found within the array, return the index of the matched element. If the search value is not found after going through the entire array, return -1, indicating that the search value is not present in the array.