Which of the following sorting algorithms is similar to selection sort in terms of repeatedly finding the minimum element from the unsorted portion and placing it at the beginning?

  • Bubble Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
The sorting algorithm similar to selection sort, in terms of repeatedly finding the minimum element from the unsorted portion and placing it at the beginning, is Insertion Sort. Both algorithms involve building the sorted portion of the array incrementally.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *