Question

o Quiz: Chapter 9 x G Which of the al x C Get Homework ® chet Boom Superson * F Boom Superson Ⓡ G air time jfk to hex | Proposal and Re x + - 0 X + → c collin.instructure.com/courses/847237/quizzes/1668757/take Collaborations Finding the middle value (the median) COLLIN Chat Finding the value that appears most frequently in the data ExamSoft Redirect Tool NetTutor Question 2 2 pts Proctoru Purchase Course Materials Which of the algorithms in this chapter is easily adaptable to singly linked lists and doubly linked lists? Select all that apply. Access Digital Course Materials Bubble Sort Selection Sort Learn About Digital Options Quick Sort Office 365 Merge Sort Study Mate Radix Sort Badges Heap Sort D Question 3 2 pts

Answer 1

Correct Answer: Merge sort

Explanation:

Merge sort is easily adaptable to a singly linked list and doubly linked list because it requires only Θ(1) extra space and time complexity is low for sorting. In a liked list, sequential access is a very slow process and it makes other sorting algorithms very slow as compared to the merge sort.  

Merge sort is easy to implement and faster as compared to bubble sort, selection sort, quick sort, radix sort, and heap sort.

So, Merge sort is the correct option.