An algorithms question using the java language For each of

.. An algorithms question using the java language

For each of the two types of lists in the following table, compute the asymptotic worst-case running time for each dynamic-set operation listed and complete the table below.

Solution

OPERATION UNSORTED, SINGLE LINKED LIST UNSORTED, DOUBLE LINKED LIST SEARCH(L,K) O(N) O(N) INSERT(L,X) O(1) O(1) DELETE(L,X) O(1) O(1)