Question

Complete the following table by identifying the Big-O complexity of the operation when performed on each data structure as implemented by the C++ Standard Template Library (STL). Select "Not Available" if the STL does not support the operation.

This is only for std::list<T> (Doubly Linked List)

Operation Description std::array<T> (Fixed Sized Vector) std::vector<T> (Extendable Sized Vector) std::forward_list<T> (Singly Linked List) std::list<T> (Doubly Linked List) default construction create container with no arguments empty checks whether the container is empty size returns the number of elements held in the container MW equality lexicographically compares the values in two containers clears the container's contents resulting in an empty container clear Mwm at, operatori direct access to specified element front direct access to the first element back direct access to the last element resize changes the number of elements held in the container insert insert an element erase erase an elements push_back adds an element to the end pop_back removes the last element push_front inserts an element at the beginning pop_front removes the first element find searches for an arbitrary value in an arbitrarily filled container splice moves all elements from another container into this container

Answer 1

default construction : O(1) : just create empty container (doubly linked list)

empty( ): O(1) : returns whether the list is empty or not.

size( ): O(1) : returns the number of elements in the list

equality : O(N) : compare two list and checks until a mismatch found.

clear : Not available

at, operator[] : Not available

front( ): O(1) : returns reference to the first element in the list.
back( ): O(1) : returns reference to the last element in the list.

resize() : Not available

insert( ): O(N) : insert new elements in the list before the element on the specified position.

erase( ): O(N) : removes a single element or the range of element from the list.

assign( ): O(N) : assigns new elements to the list by replacing its current elements and change its size accordingly.


push_back( ): O(1) : adds a new element at the end of the list, after its current last element.

pop_back( ): O(1) : removes the last element of the list
push_front( ): O(1) : adds a new element at the beginning of the list, before its current first element.

pop_front( ): O(1) : removes the first element of the list.