📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!


    Question

    Which of the following sorting algorithms is best for

    nearly sorted data?
    A QuickSort Correct Answer Incorrect Answer
    B BubbleSort Correct Answer Incorrect Answer
    C InsertionSort Correct Answer Incorrect Answer
    D MergeSort Correct Answer Incorrect Answer
    E HeapSort Correct Answer Incorrect Answer

    Solution

    InsertionSort is efficient for nearly sorted data with time complexity close to O(n).

    Practice Next
    ask-question