Algorithms · Question 21 · Medium
Algorithms question 21
Bubble sort is applied to the array [4, 1, 3, 2] in ascending order. What does the array look like after the first pass (one sweep of adjacent comparisons from left to right)?
- [1, 4, 3, 2]
- [1, 3, 4, 2]
- [1, 3, 2, 4]
- [1, 2, 3, 4]
Answer and explanation
Answer: C. [1, 3, 2, 4]
Explanation: 4 and 1 swap to give [1, 4, 3, 2], then 4 and 3 swap to give [1, 3, 4, 2], then 4 and 2 swap to give [1, 3, 2, 4]. The largest element has moved to the end.
Previous: What is the time complexity of finding the largest element in an unsorted… · Next: Two sorted lists with 6 and 9 elements are merged into one sorted list using…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- Which algorithm finds single-source shortest paths correctly even when some…
- What is the worst-case time complexity of merge sort on n elements?
- What is the time complexity of finding the largest element in an unsorted…
- Two sorted lists with 6 and 9 elements are merged into one sorted list using…
- An undirected weighted graph has the edges A-B 4, A-C 1, B-C 2, B-D 5, C-D 8…
- What is the solution of the recurrence T(n) = T(n - 1) + n, with T(1) = 1?
- Coins of ₹2, ₹3 and ₹5 are available in unlimited supply. In how many…
- Selection sort (ascending) is applied to [29, 10, 14, 37, 13]. In each pass…
- What is the edit distance (minimum number of single-character insertions…
- Four matrices with dimensions 5×10, 10×3, 3×12 and 12×5 are multiplied as a…
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge