Discussion
Which of the following sorting algorithms is based on the concept of repeatedly finding the minimum element ?
Answer: B
The algorithm is Selection Sort.
Selection sort repeatedly finds the minimum element of the unsorted part and swaps it into the next position of the sorted part, so after k passes the first k elements are in final order.
Quick sort partitions around a pivot, bubble sort swaps adjacent out-of-order pairs, and merge sort divides and merges, so none of them works by repeatedly selecting the minimum.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development