Sorting Algorithms Quiz

What is the primary purpose of sorting algorithms?

• To encrypt data for security
• To compress data for storage
• To organize data for efficient searching
• To visualize data in graphs

In the bubble sort algorithm, what is the term for a single pass through the list?

• Iteration
• Comparison
• Pass
• Cycle

How many comparisons are made in the worst-case scenario of bubble sort with n items?

• n
• n²
• n(n-1)/2
• n(n-1)

What is the time complexity of the bubble sort algorithm?

• O(n)
• O(n log n)
• O(n²)
• O(log n)

Which of the following statements is true about the merge sort algorithm?

• It is less efficient than bubble sort
• It divides the list into sublists
• It requires more passes than bubble sort
• It only works with numerical data

What is the first step in the merge sort process?

• Merge the lists
• Sort the lists
• Divide the unsorted list into sublists
• Count the number of elements

In merge sort, how many sublists are created from a list of n elements initially?

• n
• n/2
• 1
• n-1

What is the time complexity of the merge sort algorithm?

• O(n)
• O(n²)
• O(n log n)
• O(log n)

Which of the following best describes the 'divide and conquer' strategy used in merge sort?

• Breaking a problem into smaller subproblems
• Sorting elements in place
• Using recursion to sort elements
• Combining sorted lists into one

What happens to the largest unsorted element during each pass of the bubble sort?

• It is moved to the front
• It is removed from the list
• It is ignored
• It bubbles up to its correct position