Searching and sorting algorithms
30
0/1

An automation script is used to sort the run-times (in minutes) of six background tasks:

[24,11,35,8,19,14] [24, 11, 35, 8, 19, 14] [24,11,35,8,19,14]

The script uses a standard ascending bubble sort, where the largest values bubble to the end of the unsorted portion of the list in each pass. Identify the state of the list immediately after the second pass of the bubble sort has been completed.

[11,8,19,14,24,35][11, 8, 19, 14, 24, 35][11,8,19,14,24,35]

[11,24,35,8,19,14][11, 24, 35, 8, 19, 14][11,24,35,8,19,14]

[11,24,8,19,14,35][11, 24, 8, 19, 14, 35][11,24,8,19,14,35]

[8,11,35,24,19,14][8, 11, 35, 24, 19, 14][8,11,35,24,19,14]

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