Question Bank: Sorting

What is the primary goal of sorting?

Which sorting method repeatedly compares adjacent elements and swaps them if they are out of order?

In Bubble Sort, how many passes are required to sort a list of n elements?

What is a common use case for sorting algorithms?

Which of the following is NOT a valid sorting order?

In which type of sorting algorithm are elements swapped in each pass regardless of their position?

What is a key disadvantage of Bubble Sort compared to more advanced algorithms?

What happens after each complete pass in Bubble Sort?

When sorting strings, which of the following is a valid method of ordering?

Which sorting algorithm is generally more efficient than Bubble Sort for large datasets?

In the context of data organization, why is sorting important?

Which sorting algorithm builds the final sorted array one item at a time?

When comparing Quick Sort to other algorithms, what is an advantage it has?

What is a key characteristic of the Selection Sort algorithm?

What is the worst-case time complexity of Bubble Sort?

Which of the following statements about Bubble Sort is true?

How does Bubble Sort determine when to stop sorting?

In Bubble Sort, what happens in the 'inner' loop?

What type of data structure is commonly used to implement Bubble Sort?

What is the best-case time complexity of Bubble Sort?

Which of the following is not an advantage of Bubble Sort?

Which modification can improve the efficiency of Bubble Sort?

How does Bubble Sort correctly handle equal elements?

What is the first step in the Selection Sort algorithm?

If the Bubble Sort algorithm is optimized to stop early when no swaps are made in a pass, what is this optimization called?

During which pass of the Selection Sort is the smallest element identified and swapped to the sorted list?

How many total comparisons would be performed in the worst-case scenario for an array of size n using Bubble Sort?

In Selection Sort, how many total passes through the list are required?

If we were to modify Bubble Sort to sort in descending order, what change needs to be made in the conditional statement?

Which of the following statements about Selection Sort is true?

What is the time complexity of the Selection Sort algorithm?

After 3 passes of Selection Sort on the list [64, 25, 12, 22, 11], what will the partially sorted list look like?

If given a list of elements, what is the first value to swap in Selection Sort with the list [9, 4, 6, 2, 5]?

What is a primary disadvantage of using Selection Sort?

How does the Selection Sort algorithm handle duplicate values?

In Selection Sort, what does the 'flag' variable represent?

What is a common misconception about Selection Sort compared to Bubble Sort?

How can Selection Sort be implemented recursively?

In Selection Sort, if you are sorting in descending order, the largest element is swapped to which position in the first pass?

What is the time complexity of Bubble Sort in the average case?

How does the time complexity of Insertion Sort compare to that of Bubble Sort?

Which of the following algorithms has the best average time complexity?

If an algorithm has a time complexity of O(n^3), what does it imply?

Which statement is true regarding time complexity?

In a nested loop algorithm, how is the time complexity generally determined?

Why is O(1) referred to as constant time complexity?

What is the impact of having a better time complexity on an algorithm?

Which is a characteristic feature of Linear time complexity algorithms?

Selection Sort typically has a time complexity of?

Which algorithm is generally preferred for large datasets due to its logarithmic performance?

The term 'big O notation' is used to describe?

For which of the following scenarios would O(n^2) complexity be acceptable?

Which of the following sorting algorithms uses a divide-and-conquer approach?

What will happen to the time complexity of an algorithm if you halve the input size?

What is the primary purpose of the Insertion Sort algorithm?

In Insertion Sort, which part of the list is considered sorted during the algorithm's execution?

What is the time complexity of the Insertion Sort algorithm in the worst-case scenario?

If the initial list is [5, 2, 4, 6, 1, 3], what will be the list after the first pass of Insertion Sort?

Which of the following best describes the stability of the Insertion Sort algorithm?

What is the best-case scenario for the number of operations in Insertion Sort?

Which data structure best represents a list when implementing the Insertion Sort algorithm?

What element is compared first in the second pass of Insertion Sort for the list [8, 4, 3, 7, 5]?

After how many passes would the list [1, 3, 2] be completely sorted using Insertion Sort?

What is the average time complexity of Insertion Sort?

What is a common application of Insertion Sort in real life?

In which case would Insertion Sort outperform more complex algorithms like Quick Sort?

What happens if an element smaller than all existing elements in the sorted list is placed in Insertion Sort?

Which statement is true regarding the space complexity of Insertion Sort?