Scribd Logo
Upload

Welcome to Scribd!

  • Explanation - Ques-16 - Compressed

    Uploaded by

    Siddharth Dwivedi
    16 views1 page
    The document discusses maintaining a sorted linked list order after inserting elements. It proposes inserting all elements at the beginning of the linked list, then using merge sort in O(nlogn) time to sort the list, achieving an overall time complexity of O(n) for insertion and O(nlogn) for sorting. This maintains the sorted order of the linked list while minimizing time complexity.

    Original Description:

    question_16_2018_gate

    Original Title

    Explanation - ques-16_compressed

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses maintaining a sorted linked list order after inserting elements. It proposes inserting all elements at the beginning of the linked list, then using merge sort in O(nlogn) time to sort the list, achieving an overall time complexity of O(n) for insertion and O(nlogn) for sorting. This maintains the sorted order of the linked list while minimizing time complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    16 views1 page

    Explanation - Ques-16 - Compressed

    Uploaded by

    Siddharth Dwivedi
    The document discusses maintaining a sorted linked list order after inserting elements. It proposes inserting all elements at the beginning of the linked list, then using merge sort in O(nlogn) time to sort the list, achieving an overall time complexity of O(n) for insertion and O(nlogn) for sorting. This maintains the sorted order of the linked list while minimizing time complexity.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 1

    Explanation:-

    As the question says linked list order needs to be maintained in sorted order,

    But nowhere it is mentioned that sorted order needs to be maintained after


    every insertion. Overall it should be sorted.

    We can simply insert all the elements at the beginning of the linked list and then
    sort it using merge sort which will take O(nlogn) time .

    The Linked list insertion operations will take O(1) time. It means a constant
    amount of time for insertion. Total number of elements inserted into an empty
    linked list is O(n). So, it will take O(n) time in the worst case.

    After inserting elements into an empty linked list we have to perform sorting
    operation. To get minimum time complexity to perform sorting order is merge
    sort. It will give O(nlogn) time complexity only.

    Below is the detailed solution.

    You might also like