please tell me the concept behind point no. 2( array & L.L).
for list I've assumed 3 basic operation - Search, Insertion, Deletion
Insertion will take O(n) time because here worst case is the insertion before the 1st element of array causing shifting of n elements. or when the existing list is full & we're going to add more element then the approach is to make an array of double size of the existing array & copy all elements in the new array then insert.
Deletion will take O(n) time because for same reason(shifting).
search will take O(n) time in worst case generally.
Inserting an element into L.L will take O(n) time as we've to traverse all the way from head to last node.
Deletion will take O(n) time.
Search will take O(n) time.
So, where is the efficiency???