well actually i was confused with the size of the list and the position of the element if we consider the size of the list to be m and the position to be n then we should consider o(m) and not o(n) because n < m anyways.....and the list will be traveresed only m times so fine now....
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
