QWhich of the following sorting algorithms works by repeatedly selecting the minimum element from the unsorted part of the array and putting it at the beginning of the sorted part?

Choose the Best Option

Click any option to instantly check if you're correct.

• A Bubble sort ✔ ✖
• B Selection sort ✔ ✖
• C Insertion sort ✔ ✖
• D Merge sort ✔ ✖

Share This Question

Challenge a friend or share with your study group.

Related MCQ Questions