Algorithms · Question 26 · Medium
Algorithms question 26
Selection sort (ascending) is applied to [29, 10, 14, 37, 13]. In each pass the minimum of the unsorted part is swapped into place. What is the array after the first 2 passes?
- [10, 13, 29, 37, 14]
- [10, 13, 14, 29, 37]
- [10, 29, 14, 37, 13]
- [10, 13, 14, 37, 29]
Answer and explanation
Answer: D. [10, 13, 14, 37, 29]
Explanation: Pass 1 swaps 10 with 29, giving [10, 29, 14, 37, 13]. Pass 2 finds the minimum 13 in the rest and swaps it with 29, giving [10, 13, 14, 37, 29].
Previous: Coins of ₹2, ₹3 and ₹5 are available in unlimited supply. In how many… · Next: What is the edit distance (minimum number of single-character insertions…
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
- 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…
- 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…
- Lomuto partition with the last element as the pivot is applied once to [7, 2…
- What is the length of the longest strictly increasing subsequence of [3, 10…
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