Question

    Consider a code flow where a large dataset is stored in

    an array. If frequent insertions and deletions are required at arbitrary positions within the array, what is the typical time complexity impact?
    A O(1) for both insertion and deletion Correct Answer Incorrect Answer
    B O(log n) for both insertion and deletion Correct Answer Incorrect Answer
    C O(n) for both insertion and deletion Correct Answer Incorrect Answer
    D O(n log n) for insertion, O(n) for deletion Correct Answer Incorrect Answer
    E O(1) for insertion, O(n) for deletion Correct Answer Incorrect Answer

    Solution

    In an array, inserting or deleting an element at an arbitrary position requires shifting subsequent elements to maintain contiguity, leading to a time complexity of O(n) in the worst case.

    Practice Next
    More Data Structure Questions
    ask-question