Alsager - A2 - 2.3.3 - Sorting Algorithms

Which of the following is NOT listed as a standard algorithm?

• Bubble sort

• Insertion sort

• Selection sort

• Quick sort

Sorting algorithms are designed to take a number of elements and output them in what type of order?

• Random order

• Logical order

• Reverse order

• Fixed order

Most sorting algorithms will output elements in which order by default?

• Descending order

• Random order

• Ascending order

• Alphabetical order

What does the Bubble Sort algorithm do with the largest element in the unsorted part of the input during each iteration?

• Moves it to a random position

• Leaves it in its original position

• "Bubbles" it to the bottom of the data

• "Bubbles" it to the top of the data

How many passes will an algorithm perform on an array with n elements in a Bubble Sort?

• n/2 passes

• 2n passes

• n passes

• n-1 passes

What is the purpose of the temporary store in the Bubble Sort algorithm?

• To keep track of the number of swaps

• To store the array before sorting

• To hold a value during the swap operation

• To optimize the sorting speed

What is the first step in the bubble sort algorithm?

• Swap the first two elements if they are in the wrong order.

• Compare the first two elements and swap them if they are in the correct order.

• Compare the first two elements and move on if they are in the correct order.

• Swap all elements that are in the wrong order.

After the first pass of the bubble sort algorithm, what is the position of the largest element in the array?

• It remains in its original position.

• It is in the second position from the start.

• It is at the end of the array.

• It is in the second position from the end.

What indicates the end of a pass in the bubble sort algorithm?

• When all elements are in ascending order.

• When the last two elements are compared and swapped if necessary.

• When no elements have been swapped in the pass.

• When the first two elements are compared a second time.

What happens at the beginning of the second pass of the bubble sort algorithm?

• The algorithm stops as the array is sorted.

• The first two elements are compared and swapped if they are in the correct order.

• The first two elements are compared and swapped if they are in the wrong order.

• The algorithm repeats the first pass without any changes.