Which of the following sorting procedure is the slowest ?
| A. | Quick sort |
| B. | Heap sort |
| C. | Shell sort |
| D. | Bubble sort |
|
Option: D Explanation : Click on Discuss to view users comments. |
Which of the following sorting method is stable ?
| A. | Straight insertion sort |
| B. | Binary insertion sort |
| C. | Shell sort |
| D. | Heap sort |
|
Option: A Explanation : Click on Discuss to view users comments. |
Which of the following best describes sorting ?
| A. | Accessing and processing each record exactly once |
| B. | Finding the location of the record with a given key |
| C. | Arranging the data (record) in some given order |
| D. | Adding a new record to the data structure |
|
Option: C Explanation : Click on Discuss to view users comments. |
A sort which compares adjacent elements in a list and switches where necessary is
| A. | insertion sort |
| B. | heap sort |
| C. | quick sort |
| D. | bubble sort |
|
Option: D Explanation : Click on Discuss to view users comments. |
