COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Takes each item in turn and puts it in the right place using the first item in the list as a starting point.
|
|
Bubble sort
|
|
|
Insertion sort
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -Wikipedia: Insertion sort is a simple sorting algorithm that is relatively efficient for small lists and mostly sorted lists, and often is used as part of more sophisticated algorithms. It works by taking elements from the list one by one and inserting them in their correct position into a new sorted list.
Detailed explanation-2: -7. What will be the number of passes to sort the elements using insertion sort? Explanation: The number of passes is given by N-1.
Detailed explanation-3: -1. Which of the following is correct with regard to insertion sort? Explanation: During insertion sort, the relative order of elements is not changed. Therefore, it is a stable sorting algorithm.
There is 1 question to complete.