Ask for a book that recommends data structures, c description, and hope that prawns will not hesitat

Updated on technology 2024-04-03
12 answers
  1. Anonymous users2024-02-07

    C++ Data Structures and Programming", Translated Edition, Robert LKruuse and Alexander Jby Ryba.

    That's what I used to learn about data structures.

  2. Anonymous users2024-02-06

    No matter what, I would like to introduce you a good book "Programming Jewels" is very good, and I wish you happy studying.

  3. Anonymous users2024-02-05

    I have read a book of data structures (C language version), but it can also be run on C++, edited by Yan Weimin and Wu Weimin.

  4. Anonymous users2024-02-04

    Data Structures and Algorithms by Peng Bo.

    That's what I learned, and it's pretty good.

  5. Anonymous users2024-02-03

    1. C++ Data Structures and Algorithms Fourth Edition, a classic textbook of computer science abroad, written by Jozdeke in the United States, translated by Xu Dan and Wu Weimin, published by Tsinghua University Limb Bend Press;

    2. Object-Oriented Methods for Data Structures and C Language Description, Second Edition, Tsinghua University Computer Series Textbook, Textbook of the Eleventh Five-Year Plan for General Higher Education;

    3. "Data Structure Tutorial Fourth Edition", the best-selling data structure tutorial, with a cumulative print run of nearly 300,000 silver books, has been selected as a textbook by hundreds of schools, with complete supporting facilities, providing electronic textbooks, micro-courses, question banks, syllabuses and curriculum resources.

  6. Anonymous users2024-02-02

    Basically, the classics are the ones on the first floor that are said.

    If you don't ask for anything and the landlord is confused, I'm going to share my experience with the landlord.

    If you want to get started with the C language, it is definitely Tan Haoqiang's "C Programming", and if C is basically the same now, use C++ Primary as a reference book.

    The data structure is "Data Structure and Algorithm" published by Professor Yan Weimin published by Tsinghua University

    Data structure is almost the same, one algorithm is enough, and the "Introduction to Algorithms" of the mechanical industry is all classics, and if you want to learn it well, it will take 1 or 2 years.

    As far as personal experience feels, the combination of reading books and programming is the most solid to learn, and it is recommended that the landlord make up the questions in the book that are not visible at a glance, so that although there is a lot of time, it is absolutely solid and has a solid foundation, no matter what programming you learn in the future, it is very useful, and you can communicate more in the future.

  7. Anonymous users2024-02-01

    There are five kinds of characters g(4), o(6), e(1), s(2), and d(2), and the number of nodes is 2*n-1, so a total of 2*5-1=9 nodes with weighted paths can be calculated by the Huffman tree.

    The construction method of the Hefman tree is to find the two smallest weights to form the subtree at a time, and their sum is used as a new weight to participate in the construction, the original two responsibilities are removed from the weight set, and then the smallest of the two sets is found to form the subtree, and go down at once.

    o: 1,g:01 , d:001 , s:0001, e:0000

  8. Anonymous users2024-01-31

    Yan Weimin's "Data Structure (C Language Version)" is an absolute classic. The explanation is detailed and thorough. It's the one on the right in the picture below.

    The one on the left is a set of worksheets. Read the pseudo-** on the book clearly, the supporting exercises can be thorough, absolutely enough for daily use, and the work is easy. When you get to binary trees and graphs, you're no ordinary programmer.

    Don't look at the electronic version, get a txt, pdf can't learn in depth at all, go to the bookstore or buy a genuine copy online, it's comfortable to use.

    To learn data structures, you need to have a certain foundation in the C language, at least understand the use of pointers.

    It is recommended not to rush the reading speed, but to pay attention to detail, study carefully, and read carefully.

  9. Anonymous users2024-01-30

    C++ Basics:

    C++ Primer is a must-see, and now it's in its fifth edition.

    Accelerated C++ is still necessary to read 2 basic books.

    C++ Promotion:

    Exploring the C++ Object Model in Depth" is about a compiler that if you construct a C++ object, you must read, and a good book does not explain it.

    effective c++》

    more effective c++》

    C++ Must Know Must Know

    The above three books teach you how to write C++** better and more efficiently.

    The library "Generic Programming and STL" is a must-see, generic programming is very important, and the book "STL Source Code Analysis" is more difficult, and it is not recommended to read it without a solid foundation.

    Algorithms and data structures.

    The most classic book is "The Art of Computer Programming", but I don't recommend it, if you have to read it, and after reading it, remember to send a resume to Bill Gates.

    I only recommend two books, "Introduction to Algorithms" and "Algorithm Art and Informatics Competition", especially the master works of "Introduction to Algorithms", which are all authoritative and worth learning.

  10. Anonymous users2024-01-29

    "Data Knots", edited by Yan Weimin;

    Discrete Mathematics Combinatorial Mathematics

    The information can be searched on the Internet, you can take a look.

  11. Anonymous users2024-01-28

    C Language: Tam Ho-keung; c++primer;Data structure Yan Weimin.

  12. Anonymous users2024-01-27

    C++Primer, "Data Structure" Yan Weimin's more classic.

Related questions
9 answers2024-04-03

A hash table (also known as a hash table) is a data structure that is directly accessed based on the key value. That is, it accesses records by mapping key values to a location in the table to speed up lookups. This mapping function is called a hash function, and the array that holds the records is called a hash table. >>>More

3 answers2024-04-03

I have the same issue.

9 answers2024-04-03

Answer: c. The storage structure with a binary linked list is also the storage structure of the left child and the right brother. >>>More

16 answers2024-04-03

Just o(n) scans it once, millions of arrays are not big, and c can be opened so big for global variables. >>>More

18 answers2024-04-03

It's not low, but it's ......It's not worth the effort ...... this program