but as far as i know binary search takes O(logn)time to search an element On Tue, Mar 8, 2011 at 9:35 PM, ravi teja <[email protected]> wrote:
> Yes , it is possible . But it does not make sense . The thing that matters > while doing binary search for arrays is that we can access any element in > O(1) time . But , for a linked list it becomes an average of O(n) . And on > average we have an O(nlogn) algorithm with highly confusing code and messy > pointers . > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- UTKARSH SRIVATAV CSE-3 B-TECH 2nd YEAR MNNIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
