MCQOPTIONS
Saved Bookmarks
| 1. |
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 plan? |
| A. | Insertion sort |
| B. | Internal sort |
| C. | External sort |
| D. | Radix sort |
| Answer» B. Internal sort | |