Back to the full dot-point answer
EnglandComputer ScienceQuick questions
2.3 Algorithms
Quick questions on Bubble, insertion, merge and quick sort with Big-O - OCR A-Level Computer Science H446
3short 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 worst-case time complexity of bubble sort and of merge sort. [2 marks]
What is q2?Show answer
State what quick sort does after choosing a pivot. [2 marks]
What is q3?Show answer
State one situation where insertion sort performs close to . [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.