Data Structures and Algorithm Analysis Second Edition

Is the book Data Structures and Algorithmic Analysis: a Description in C (Original Book, 2nd Edition) OK compared to other books? What kind of foundation do I need to read this book?

Um, I think what you mean by “Data Structures and Algorithm Analysis” is the one written by Weiss, and that book has been given a 9 out of 10 by Douban, which is a very high score, but the world of computers is like a vast ocean of classics, and there are a lot of amazing programming books out there.

Kernighan’s The Practice of Programming is a great book for getting a full understanding of what programming is all about, even if it’s very thin.

Cormen’s Introduction to Algorithms and Skiena’s Handbook of Algorithmic Design are bigger books than Data Structures and Analysis of Algorithms.

Bentley’s Programming Pearls (Volumes 1,2) will take you through the power of algorithms.

Hou Jie’s “STL Source Code Dissection” goes into the implementation details of the C++ standard library, so you can really see what the best of the best are doing.

stevens’s Advanced Programming for Unix Environments, Network Programming for Unix is a treasure trove of programmer’s advancement, and should be read again and again, because you’ll eventually understand that your program runs on an operating system, and needs to interact with the network, and you need to understand them and get friendly with them.

The three great books by Bjarne Stroustrup, the father of C++: The C++ Programming Language, Principles and Practice of C++ Programming, and The Design and Evolution of the C++ Language, are the most authoritative guides to the C++ language, as well as classic programming works.

Bryant’s Deeper Understanding of Computer Systems are all sky-high books that can tell you what the computer does underneath so that you can understand it better and utilize the CPU better.

The classics on software development are “The Programmer’s Way”, “The Code Book”, “Refactoring”, and “Design Patterns”, all of which are must-read books for programmers in any programming forum’s recommendation list.

There’s also a book called “The Construction and Interpretation of Computer Programs”, a god-like work that can turn your programming mindset upside down.

Of course, the top of the computer algorithms to be counted knuth’s “the art of computer programming” (1-4 volumes), its content is very deep, very broad, very difficult, that is really like a vast ocean, breathtaking.

There are specialties in every field, and there are classics in every field, which you will have to explore further according to your personal interests. For example, programming languages and compilers, operating system kernels, hardware design, artificial intelligence and machine learning, natural language processing, information theory and signal processing, network programming, robotics, and so on.

Looking for a good book on data structures and algorithms

Data Structures and Algorithm Analysis – A Description in C (original book, 2nd edition), in English, is titled DataStructuresandAlgorithmAnalysisinC, by (US) The original book was named one of the top 30 computer books of the 20th century. The simplified Chinese version of this book is quite well translated .

The more simple and easy to understand, 1. Data Structure and Algorithm Analysis (Java version of the higher education computer application technology series of textbooks) Wang Shimin

Tsinghua University Press (2005-07 publication)

2. Data Structure – Java language description (higher education textbook of computer science and technology) Zhu Zhaoli

Tsinghua University Press (2005-12 Publication)

I have two data structures questions hopefully I can give detailed answers and steps to do them?

The status of Data Structures and Algorithms is self-evident to a programmer. Today’s post is not to persuade you to learn data structures and algorithms or to talk to you about how important they are.

Mainly, in recent days, some readers in the background have asked me how to learn data structures and algorithms, whether there are any shortcuts, whether they have to watch videos or read books, and where to go to brush up their questions, etc…… And some of them are juniors and seniors, which makes me anxious and worried for you …..

So I’m going to share how I usually study today.

The shortcut to learning algorithms is to brush up on problems

To be honest, I think the shortcut is to get down to business and brush up on problems.

But if you are a beginner, that is to say, you even common data structures, such as chain lists, trees and common algorithmic ideas, such as recursion, enumeration, dynamic programming, these have not learned, then I do not recommend that you go to brush the problem. Instead, go find a book to learn these first, and then go brush up.

That is to say, if you want to go to these sites such as leetcode brush, then, you have to have a certain foundation, these foundations include:

1, common data structures: chained lists, trees (such as binary trees).

2, common algorithmic ideas: greedy method, partition method, exhaustive method, dynamic programming, backtracking.

The above listed is considered the most basic. That is to say, before you brush the question, to these over again to brush the question. If you don’t even know the basics, then you’ll have a hard time brushing up, and you’ll have relatively few ideas.

In short, don’t be in a hurry, go through these basic ones first, try to understand them, and then go brush up. These basic data structures and algorithms, I learned in the second semester of my freshman year, I did not watch the video, I learned by reading the book, then read the book is:

1, algorithmic analysis and analysis of the fundamentals of: this is relatively simple, recommended for newcomers to see.

2, data structures and algorithm analysis – C language description: code written in C, recommended to see.

3, Challenge Programming Competition (Second Edition): also a very good book, recommended to see.