Fill in the blanks in terms of the big-theta (��) notation to show the asymptotic running time complexity of each operation. For this question, suppose that the dynamic array is unsorted, and thesingly linked list is unsorted and holds only a head pointer. n is the number of contained entries, and the stored data (of integer type)can be used as a key. 

Leave a Reply