1. Look back at the Number Guessing Game you created that uses a binary search for the computer to guess the user's number OR look at the code below that would work for any generic binary search of a...

Thank you, it doesn’t have to be a large or complex explanation.

high set ourrent index to average of taw and high find the middle word set cunentem to Item current Index of data if current item value report true else current tem> value eliminate half the list set high current Index-O to else set low to current Index report fale Under what conditions would you need a linear search algorithm rather than a binary search algorithm? "/>
Extracted text: 1. Look back at the Number Guessing Game you created that uses a binary search for the computer to guess the user's number OR look at the code below that would work for any generic binary search of a list. Describe how the binary search procedure uses selection to determine whether or not the input "value" exists in a given list in a way that most likely takes fewer steps than a linear search would. (U5L1p3) binary search for value in data script varlables low high current Index current item 0 set low to 1 set high to length of data repeat until low > high set ourrent index to average of taw and high find the middle word set cunentem to Item current Index of data if current item value report true else current tem> value eliminate half the list set high current Index-O to else set low to current Index report fale Under what conditions would you need a linear search algorithm rather than a binary search algorithm?