Shaffer - Data Structures and Algorithm Analysis in C++

Data Structures and Algorithm Analysis in C++ — read online for free the complete book (whole text) full work

Below is the text of the book, divided by pages. System saving the place of the last page read, allows you to conveniently read the book "Data Structures and Algorithm Analysis in C++" online for free, without having to search again every time where you left off. Put a bookmark, and you can go to the page where you finished reading at any time.

Light

Font size:

↓

↑

Georgia Tahoma Arial Verdana

Reset

Interval:

↓

↑

Bookmark:

Make

1234567...161

Table of Contents

Bibliography

[AG06]	Ken Arnold and James Gosling. The Java Programming Language . Addison-Wesley, Reading, MA, USA, fourth edition, 2006.
[Aha00]	Dan Aharoni. Cogito, ergo sum! cognitive processes of students dealing with data structures. In Proceedings of SIGCSE00 , pages 2630, ACM Press, March 2000.
[AHU74]	Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms . Addison-Wesley, Reading, MA, 1974.
[AHU83]	Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms . Addison-Wesley, Reading, MA, 1983.
[BB96]	G. Brassard and P. Bratley. Fundamentals of Algorithmics . Prentice Hall, Upper Saddle River, NJ, 1996.
[Ben75]	John Louis Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM , 18(9):509517, September 1975. ISSN: 0001-0782.
[Ben82]	John Louis Bentley. Writing Efficient Programs . Prentice Hall, Upper Saddle River, NJ, 1982.
[Ben84]	John Louis Bentley. Programming pearls: The back of the envelope. Communications of the ACM , 27(3):180184, March 1984.
[Ben85]	John Louis Bentley. Programming pearls: Thanks, heaps. Communications of the ACM , 28(3):245250, March 1985.
[Ben86]	John Louis Bentley. Programming pearls: The envelope is back. Communications of the ACM , 29(3):176182, March 1986.
[Ben88]	John Bentley. More Programming Pearls: Confessions of a Coder . Addison-Wesley, Reading, MA, 1988.
[Ben00]	John Bentley. Programming Pearls . Addison-Wesley, Reading, MA, second edition, 2000.
[BG00]	Sara Baase and Allen Van Gelder. Computer Algorithms: Introduction to Design & Analysis . Addison-Wesley, Reading, MA, USA, third edition, 2000.
[BM85]	John Louis Bentley and Catherine C. McGeoch. Amortized analysis of self-organizing sequential search heuristics. Communications of the ACM , 28(4):404411, April 1985.
[Bro95]	Frederick P. Brooks. The Mythical Man-Month: Essays on Software Engineering, 25th Anniversary Edition . Addison-Wesley, Reading, MA, 1995.
[BSTW86]	John Louis Bentley, Daniel D. Sleator, Robert E. Tarjan, and Victor K. Wei. A locally adaptive data compression scheme. Communications of the ACM , 29(4):320330, April 1986.
[CLRS09]	Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms . The MIT Press, Cambridge, MA, third edition, 2009.
[Com79]	Douglas Comer. The ubiquitous B-tree. Computing Surveys , 11(2):121137, June 1979.
[DD08]	H.M. Deitel and P.J. Deitel. C ++ How to Program . Prentice Hall, Upper Saddle River, NJ, sixth edition, 2008.
[ECW92]	Vladimir Estivill-Castro and Derick Wood. A survey of adaptive sorting algorithms. Computing Surveys , 24(4):441476, December 1992.
[ED88]	R.J. Enbody and H.C. Du. Dynamic hashing schemes. Computing Surveys , 20(2):85113, June 1988.
[Epp 10]	Susanna S. Epp. Discrete Mathematics with Applications . Brooks/Cole Publishing Company, Pacific Grove, CA, fourth edition, 2010.
[ES90]	Margaret A. Ellis and Bjarne Stroustrup. The Annotated C ++ Reference Manual . Addison-Wesley, Reading, MA, 1990.
[ESS81]	S. C. Eisenstat, M. H. Schultz, and A. H. Sherman. Algorithms and data structures for sparse symmetric gaussian elimination. SIAM Journal on Scientific Computing , 2(2):225237, June 1981.
[FBY92]	W.B. Frakes and R. Baeza-Yates, editors. Information Retrieval: Data Structures & Algorithms . Prentice Hall, Upper Saddle River, NJ, 1992.
[FF89]	Daniel P. Friedman and Matthias Felleisen. The Little LISPer . Macmillan Publishing Company, New York, NY, 1989.
[FFBS95]	Daniel P. Friedman, Matthias Felleisen, Duane Bibby, and Gerald J. Sussman. The Little Schemer . The MIT Press, Cambridge, MA, fourth edition, 1995.
[FHCD92]	Edward A. Fox, Lenwood S. Heath, Q. F. Chen, and Amjad M. Daoud. Practical minimal perfect hash functions for large databases. Communications of the ACM , 35(1):105121, January 1992.
[FL95]	H. Scott Folger and Steven E. LeBlanc. Strategies for Creative Problem Solving . Prentice Hall, Upper Saddle River, NJ, 1995.
[FZ98]	M.J. Folk and B. Zoellick. File Structures: An Object-Oriented Approach with C ++. Addison-Wesley, Reading, MA, third edition, 1998.
[GHJV95]	Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software . Addison-Wesley, Reading, MA, 1995.
[GI91]	Zvi Galil and Giuseppe F. Italiano. Data structures and algorithms for disjoint set union problems. Computing Surveys , 23(3):319344, September 1991.
[GJ79]	Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness . W.H. Freeman, New York, NY, 1979.
[GKP94]	Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: A Foundation for Computer Science . Addison-Wesley, Reading, MA, second edition, 1994.
[Gle92]	James Gleick. Genius: The Life and Science of Richard Feynman . Vintage, New York, NY, 1992.
[GMS91]	John R. Gilbert, Cleve Moler, and Robert Schreiber. Sparse matrices in MATLAB: Design and implementation. SIAM Journal on Matrix Analysis and Applications , 13(1):333356, 1991.
[Gut84]	Antonin Guttman. R-trees: A dynamic index structure for spatial searching. In B. Yormark, editor, Annual Meeting ACM SIGMOD , pages 4757, Boston, MA, June 1984.
[Hay84]	B. Hayes. Computer recreations: On the ups and downs of hailstone numbers. Scientific American , 250(1):1016, January 1984.
[Hei09]	James L. Hein. Discrete Structures, Logic, and Computability . Jones and Bartlett, Sudbury, MA, third edition, 2009.
[Jay90]	Julian Jaynes. The Origin of Consciousness in the Breakdown of the Bicameral Mind . Houghton Mifflin, Boston, MA, 1990.
[Kaf98]	Dennis Kafura. Object-Oriented Software Design and Construction with C ++. Prentice Hall, Upper Saddle River, NJ, 1998.
[Knu94]	Donald E. Knuth. The Stanford GraphBase . Addison-Wesley, Reading, MA, 1994.
[Knu97]	Donald E. Knuth. The Art of Computer Programming: Fundamental Algorithms , volume 1. Addison-Wesley, Reading, MA, third edition, 1997.
[Knu98]	Donald E. Knuth. The Art of Computer Programming: Sorting and Searching , volume 3. Addison-Wesley, Reading, MA, second edition, 1998.
[Koz05]	Charles M. Kozierok. The PC guide. www.pcguide.com, 2005.
[KP99]	Brian W. Kernighan and Rob Pike. The Practice of Programming . Addison-Wesley, Reading, MA, 1999.
[Lag85]	J. C. Lagarias. The 3x+1 problem and its generalizations. The American Mathematical Monthly , 92(1):323, January 1985.
[Lev94]	Marvin Levine. Effective Problem Solving . Prentice Hall, Upper Saddle River, NJ, second edition, 1994.

Next page

1234567...161

Light

Font size:

↓

↑

Georgia Tahoma Arial Verdana

Reset

Interval:

↓

↑

Bookmark:

Make

Similar books «Data Structures and Algorithm Analysis in C++»

Look at similar books to Data Structures and Algorithm Analysis in C++. We have selected literature similar in name and meaning in the hope of providing readers with more options to find new, interesting, not yet read works.

Dr. Harsh Bhasin

Data Structures with Python: Get familiar with the common Data Structures and Algorithms in Python

Yang Hu

Graphic JavaScript Algorithms: Graphic learn Data Structure and Algorithm for JavaScript

Sonam Chawla Bhatia

Python Internals for Developers: Practice Python 3.x Fundamentals, Including Data Structures, Asymptotic Analysis, and Data Types (English Edition)

Engr. Michael David

Introduction to Data Structures and Algorithms for Beginners : Data Structures and Algorithms Made Easy

Ajit Singh

Data Structure and Algorithm: Simply In Depth

Baka

Python Data Structures and Algorithms

Maurya

Data Structures and Algorithms Made Easy with Java : Learn Data Structure using Java in 7 Days: Data Structures and Algorithmic Puzzles for Beginners to Professional

Sammie Bae

JavaScript Data Structures and Algorithms: An Introduction to Understanding and Implementing Core Data Structure and Algorithm Fundamentals

Claus Matzinger

Hands-On Data Structures and Algorithms with Rust

Narasimha Karumanchi

Data Structures and Algorithms Made Easy: Data Structure and Algorithmic Puzzles

Hemant Jain

Problem Solving in Data Structures & Algorithms Using C++: Interview preparation guide

George T. Heineman

Algorithms in a nutshell

Discussion, reviews of the book Data Structures and Algorithm Analysis in C++ and just readers' own opinions. Leave your comments, write what you think about the work, its meaning or the main characters. Specify what exactly you liked and what you didn't like, and why you think so.