Which of the following is not a property of bubble sort?

Question

BlackTom AI · Accepted Answer

Bubble sort repeatedly compares and swaps adjacent elements, so it is inherently an iterative, comparison-based sorting algorithm rather than a divide-and-conquer method.

Relevant knowledge points:
- Stability: A stable sort preserves the relative order of equal elements. Bubble sort only swaps when the left element is greater than the right, so equal items are not re-ordered.
- Adaptivity (best-case behavior): An optimized bubble sort tracks whether any swaps occurred in a full pass; if none did, the list is already sorted and the algorithm stops, giving a best-case time of O(n).
- Divide and conquer: Algorithms using divide and conquer (e.g., merge sort, quicksort) split the problem into subproblems, solve each, and combine results. Bubble sort does not split the array.
- Swap behavior: Bubble sort repeatedly compares adjacent pairs and swaps them when out of order; this is its defining operation.

Step-by-step reasoning:
1. Check "Stable sorting algorithm": Bubble sort only swaps when a[i] > a[i+1], so equal elements (a[i] == a[i+1]) remain in original order. Therefore it is stable — this option is a true property.
2. Check "Adaptive (best-case O(n))": With the common optimization (stop when a pass makes no swaps), bubble sort runs one linear pass on an already sorted array, so best-case time is O(n). Thus this option is a true property.
3. Check "Uses divide and conquer approach": Bubble sort does not partition or recursively solve subproblems; it iteratively bubbles largest items to the end. This is not a divide-and-conquer strategy. Hence this option is not a property.
4. Check "Repeatedly swaps adjacent elements": That describes bubble sort exactly; it is true.

Why the correct answer is correct:
"Uses divide and conquer approach" contradicts bubble sort’s iterative adjacent-swap mechanism and lack of problem splitting. Divide-and-conquer is a fundamentally different design paradigm.

Therefore, the correct choice is "Uses divide and conquer approach," matching the provided answer.

Which of the following is not a property of bubble sort?单项选择题

类似问题

Which of the following statements are true regarding Quicksort?

When QuickSort repeatedly produces highly skewed partitions (for example, the pivot always becomes the smallest or largest element), what is the resulting time complexity, given the explanations below?

Sorting Complexity For an array of N integers that are in the ascending order as shown below, give the time complexity for each sorting algorithm. 1,2,3, ... , N-2, N-1, N 1: Insertion Sort 2: Selection Sort 3: Bubble Sort 4: Merge Sort 5: Tree (BST) Sort (hint:Is BST very unbalanced?)

Which of the following statements are true?

Identify the code that sorts the numbers in descending order. def selection_sort(numbers): for i in range(len(numbers) - 1): index = i XXX temp = numbers[i] numbers[i] = numbers[index] numbers[index] = temp

In bubble sort, how many passes are needed to guarantee the list is sorted?

更多留学生实用工具

智能学习助手

风格化写作助手

论文查重助手

文献引用助手

课堂转译助手

课堂笔记助手

Quiz搜索助手

学校历年真题

智能刷题助手

智能匹配练习

希望你的学习变得更简单