![Question 10 (a) You have a list of 1024 sorted numbers and are looking for a particular value. It takes one time unit to compare each number to see if its the one you want. i. If we searching exhaustively across the list and the number we are looking for isnt there, how long will it take to work out that the number isnt there? You may assume that any operations other than comparison take up negligible time. [2 marks] ii. If we used binary search, how long would it take us, at most, to determine that the number wasnt there. You may assume that any operations other than comparison take up negligible time. [2 marks] (b) Provide the pseudo code algorithm for selection sort using a single array. [6 marks]](https://media.cheggcdn.com/media%2F648%2F64891530-9bd1-4402-bac5-0a480139026b%2FphpMWamxm.png)
Question 10 (a) You have a list of 1024 sorted numbers and are looking for a particular value. It takes one time unit to compare each number to see if it’s the one you want. i. If we searching exhaustively across the list and the number we are looking for isn’t there, how long will it take to work out that the number isn’t there? You may assume that any operations other than comparison take up negligible time. [2 marks] ii. If we used binary search, how long would it take us, at most, to determine that the number wasn’t there. You may assume that any operations other than comparison take up negligible time. [2 marks] (b) Provide the pseudo code algorithm for selection sort using a single array. [6 marks]
