1. Describe the steps involved in a binary search to find the value 47 in the list below
4,7,8,21,46,47,51
2. Explain why the list/array must be on order for a binary search
3. A binary search is a ‘divide and conquer’ algorithm. What you understand by this.
The resources below are here to help you with this session. The documents can be downloaded to your device and web links can be viewed online.
Keep a copy of your work safe until your first days at college. Bring it with you for your first lesson in this subject.
This list shows you all of the different activites available through Virtual Priestley. You can tick them off as you go.
Don’t feel you have to complete every task, just do the ones you think are relevant to you.
