This week's book giveaways are in the Refactoring and Agile forums. We're giving away four copies each of Re-engineering Legacy Software and Docker in Action and have the authors on-line! See this thread and this one for details.
How can we find time complexity in Collection classes.
I read some where the complexity of LinkedList is o(n) or o(1).
Even I don't know what is the above notation stands for.
Please any one share how to calculate complexity for searchning and sorting opertions. Even how do decide which one is best for particular situation.