Back to the full dot-point answer
ScotlandComputer ScienceQuick questions
Software Design and Development
Quick questions on Standard algorithms: searching, sorting, recursion and efficiency - SQA Advanced Higher Computing Science
2short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is q1?Show answer
State the precondition a binary search requires. [1 mark]
What is q2?Show answer
State roughly how the number of comparisons grows with list size n for a linear search. [1 mark]
Have a question we have not covered?
This dot-point answer is short enough that we have not extracted many short questions yet. Read the full dot-point answer or ask Mo, our study assistant, in the chat for follow ups.