Sorting
October 28, 2023Sorting
October 28, 2023Sorting
|
Question 65
|
Which sorting algorithm sorts by moving the current data element past the already sorted values and repeatedly interchanges it with the preceding value until it is in its correct place?
|
Insertion sort
|
|
|
Internal sort
|
|
|
External sort
|
|
|
Radix sort
|
Question 65 Explanation:
Inserting sorting algorithm sorts by moving the current data element past the already sorted values and repeatedly interchanges it with the preceding value until it is in its correct place.
Correct Answer: A
Question 65 Explanation:
Inserting sorting algorithm sorts by moving the current data element past the already sorted values and repeatedly interchanges it with the preceding value until it is in its correct place.