- Joined
- Feb 5, 2008
- Messages
- 6,252
- Points
- 83
Hey guys, anybody happen to be in posession of any of these books?
In short, if anybody has any of these, can you copy something or anything related to;
-a priori and a posteriori complexity analysis
-asymthotic performance time (I am just translating it directly, might not be called that way),
-O, Θ and Ω notations regarding algorythm complexity
Be sure to cite your source. I will translate and incorporate the text in my work as required by the paper's guidelines.
I'd be forever thankful, and even longer if you post something really soon.
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., Stein, C.: Introduction to Algorithms. Third Edition, The MIT Press, 2009.
- Sedgewick, R. Algorithms in C++, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms. Third Edition, Addison Wesley Professional, 2002.
- Knuth, D. E. The Art of Computer Programming, Volumes 1-3. Second Edition, Addison-Wesley Professional, 1998.
- Horowitz, E., Sahni, S., Mehta, D. (1995). Fundamentals of Data Structures in C++. W. H. Freeman, 1995.
- Aho, A. V., Hopcroft, J. E., Ullman, J. D. Data Structures and Algorithms. Addison-Wesley, 1987.
In short, if anybody has any of these, can you copy something or anything related to;
-a priori and a posteriori complexity analysis
-asymthotic performance time (I am just translating it directly, might not be called that way),
-O, Θ and Ω notations regarding algorythm complexity
Be sure to cite your source. I will translate and incorporate the text in my work as required by the paper's guidelines.
I'd be forever thankful, and even longer if you post something really soon.
