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


    âš¡ Month End Offer - Flat 52% Off On All Courses! Enroll Now âš¡
    00:00:00 AM Left

    Question

    Which sorting algorithm is known for its best-case time

    complexity of O(n) when the input is already partially sorted?
    A QuickSort Correct Answer Incorrect Answer
    B MergeSort Correct Answer Incorrect Answer
    C InsertionSort Correct Answer Incorrect Answer
    D SelectionSort Correct Answer Incorrect Answer

    Solution

    InsertionSort

    Practice Next

    Relevant for Exams:

    ask-question