Analysis of algorithm complexity on linked lists [closed]

As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or experti开发者_JS百科se, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance. Closed 11 years ago.

Please suggest me some good materials or books or links that provede the methods to find the complexity of algorithms that use linked list for their implementation. My question may sound silly to some of you but please reply.Please help

---

Introduction to Algorithms is the canonical textbook.

It is possible to find a complete PDF of this book online. I'm not going to provide a link, though, because I'm not sure if these copies are legal.

If all you're after is a quick reference, then Wikipedia is the best place to start. For instance, see the table at http://en.wikipedia.org/wiki/Linked_list#Tradeoffs.

---

Gautam I have a feeling that you are trying to skip the understanding of 'complexity analysis' portion and jump to linked-list-complexity-analysis. Just so you know, if you want to understand it truly, then you have to understand two parts 1. How to compute complexity of an algorithm 2. The flow of algorithm in question.

'linked-list-complexity-analysis ' is not something that you can understand without understanding {1} That said, if at all you want ready answer (trust me that wouldnt help you in interviews), you can refer to this book "Data structures and algorithm and applications in C++" (http://www.mhhe.com/engcs/compsci/sahni/) Highly recommended for beginner. Immensely boring, and I doubt you will read it again. :P You will find answers to your specific questions there.

After you are done with that book , I would suggest go with DataStructures using C/C++ by Langsam/tennenbaum.