Searching and sorting algorithms
19
0/4

An analyst is deciding whether to implement a bubble sort or a quick sort to arrange a large dataset of N N\,N records.

Describe two operational or performance differences between a bubble sort and a quick sort that the analyst should consider.

[4]

Searching and sorting algorithms Questions

Practise OCR GCSE Computer Science Searching and sorting algorithms with exam-style questions for GCSE Computer Science. 36 questions, matched to the OCR GCSE Computer Science (J277) specification and written in Component 01 and Component 02 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.

PreviousNext

Searching and sorting algorithms Questions

  1. GCSE
  2. /Computer Science
  3. /Searching and sorting algorithms