January 2023
Intermediate to advanced
368 pages
7h 56m
English
Content preview from A Textbook of Data Structures and Algorithms, Volume 3
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
References
- Aragon, C.R. and Seidel, R. (1989). Randomized search trees. In Proc. 30th Symp. Foundations of Computer Science (FOCS 1989). IEEE Computer Society Press, Washington, DC.
- Donald, K. (1998). Art of Computer Programming, Vol. III. 2nd edition. Addison-Wesley Professional, Reading, MA.
- Garey, M.R. and David, S.J. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York.
- Hoare, C.A.R. (1962). Quick sort. The Computer Journal, 5(1), 10–16.
- Knuth, D.E. (1973). The Art of Computer Programming, Volume 1: Fundamental Algorithms. 2nd edition. Addison-Wesley, Reading, MA.
- Malik, S. and Lintao, Z. (2009). Boolean satisfiability, from theoretical hardness to practical success. Communications of the ACM, 52(8), 76–82.
- Perlis, A.J. and Thornton, C. (1960). Symbol manipulation by threaded lists. Communications of the ACM, 3(4), 195–204.
- Pugh, W. (1990). Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), 668–676.
- Shell, D.L. (1959). A high-speed sorting procedure. Communications of the ACM, 2(7), 30–32.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.