Q: Bubble Sort Algorithm GCSE

Which description best describes a bubble sort algorithm?

What is a PASS when discussing a bubble sort?

True or False: A ‘Bubble Sort’ algorithm will step through the data set one more time before stopping, after the data set had been ordered on the previous pass.

True or False: The ‘Bubble Sort’ algorithm makes use of the principles of ‘Divide and Conquer’.

Consider the data set [5, 6, 2, 4]. What will the data set be after the first pass?

How many passes will the Bubble Sort algorithm carry out in order to sort the data [5, 6, 2, 4]], before completing/stopping?

Which answer shows the correct intermediate steps when the following data set is being sorted using a bubble sort? [16, 21, 11, 19]

True or False: A Bubble Sort is considered inefficient when compared to most other sorting algorithms.

Consider the following array [8, 3, 5, 2, 1]. How many passes will be required to move the value ‘1’ to the start of the array?

Consider the following array [8, 3, 5, 2, 1]. How many passes will be required to move the value ‘8’ to the end of the array?