Data Structures :: Searching & Sorting - Discussion
Home > Data Structures > Searching & Sorting > MCQs Questions Discussion
17 / 69
Choose the correct option.
Which of the following sorting methods would be most suitable for sorting a list which is almost sorted
ABubble Sort
BInsertion Sort
CSelection Sort
DQuick Sort
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
TRICK
Insertion sort would be most suitable for sorting a list which is almost sorted. In bubble search, mostly you have to change the whole list. Insertion sort is the partially sorted list, So and of the above question must be B, Insertion Sort.
Read Full Answer
Report Error
Please Login First Click Here
TRICK
Insertion sort would be most suitable for sorting a list which is almost sorted. In bubble search, mostly you have to change the whole list. Insertion sort is the partially sorted list, So and of the above question must be B, Insertion Sort.
Read Full Answer
Report Error
Please Login First Click Here