hello.....
assume i have an ordered list (sorted).... is it possible to insert an element in the list in O(lgn) time ?....
i dont think a list can be maintained as an array...since shifting all the elements during insertion will again result in O(n)........
if a linkedlist is used...how do i search for the elements ? because in linked lists..we lose the power to access any element in O(1) time...
if it is possible to insert an element in an linked list in logarithmic time ??
plz help !
thank u very much !