COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?4 5 9 6 2 74 5 9 6 2 74 5 9 6 2 74 5 6 9 2 7
|
|
Bubble Sort
|
|
|
Selection Sort
|
|
|
Insertion Sort
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -The algorithms we will cover are: Bubble sort. Selection sort. Merge sort.
Detailed explanation-2: -A bubble sort algorithm goes through a list of data a number of times, comparing two items that are side by side to see which is out of order. It will keep going through the list of data until all the data is sorted into order. Each time the algorithm goes through the list it is called a ‘pass’.
Detailed explanation-3: -Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity? Explanation: Both Merge sort and Insertion sort can be used for linked lists.
Detailed explanation-4: -Merge Sort Was this answer helpful?
There is 1 question to complete.