Bubble Sort Quiz

What is bubble sort?

• Bubble Sort is a divide and conquer algorithm based on the idea of breaking down a list into several sub-lists until each sub list consists of a single element and merging those sub lists in a manner that results into a sorted list.

• Bubble Sort is a simple sorting algorithm that builds the final sorted array one item at a time.

• Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in wrong order.

• Bubble Sort is a divide and conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot.

What is the advantage of bubble sort over other sorting techniques?

• It is faster

• Consumes less memory

• Detects whether the input is already sorted

• All of the mentioned

The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?

• 4

• 2

• 1

• 0

In a bubble sort structure, there is/are?

• A single for loop

• Three for loops, all separate

• A while loop

• Two for loops, one nested in the other

What is the temporary variable called?

• Substitution

• Temp

• Replacement

• Fill in