Write the algorithm in pseudocode!

_________________________________________________________________________

11. (16 points) Write an algorithm that locates an item in a list of unsorted integers by successively checking the first and then the last items in list, then he 2nd and 2nd to last item in the list, etc. It is possible that the element is not in the list. Also describe the worst-case time complexity, measured in terms of comparisons, of your algorithm