What is the difference between the data structure C and C versions 15

Updated on technology 2024-02-08
5 answers
  1. Anonymous users2024-02-05

    The algorithm is similar, but the language description is different, C is the basic! However, the C++ language is relatively simple, so it's good to get used to which one!! The data structure is mostly used in C++, it depends on which version of the textbook you use, if you learn C++, then use the C++ version of the textbook, the problem is not very big!!

    It's not the key, it's the algorithm that counts!!

  2. Anonymous users2024-02-04

    The idea is the same! It's just a different language! C++ is easier to program than C!

    Because C++ uses classes, class templates, function templates, and C++ and STL are available! C programming is relatively more complicated, but it is very useful for improving programming thinking! Overall, each has its own benefits!

  3. Anonymous users2024-02-03

    There are a lot of differences, for example, the C language does not have the amount of bool type, in addition, in terms of data structures, the C language does not have the concept of classes, and the data structure of the linked list or something is generally used as a struct, and when creating a new struct node, you also need to use the calloc function to apply for memory... After using C++, I will definitely be a little unaccustomed to using C, but although the implementation is different, I think the data structure is mainly the algorithm, and most of the data structures are still the same.

  4. Anonymous users2024-02-02

    C language is a programming language, and there are many kinds of programming languages.

    Data structures, on the other hand, are about the theoretical knowledge of some data.

    It can be said that no matter what programming language can use the knowledge of data structures, data structures are the basic and core knowledge of programming.

    You can think of C language as a language, then the data structure is a kind of speaking skills, how to make you speak more concisely, logically, easy to understand, this expression skill can be used whether you use Chinese or English.

    Of course, if you want to be a good programmer, you have to master the data structure.

  5. Anonymous users2024-02-01

    Talk about how to learn data structures:

    1.If you haven't studied C, or if you don't learn C well and you learn data structures as if they were a math book, it's all about simple graph theory. The main thread in your brain can't be lost:

    Linear structure, tree structure and graph structure. When you stop thinking about complex programming and just study the relationship between discrete points, it seems that the data structure is not so difficult.

    2.After learning the abstract discrete point relationships, and then consolidate your C language level, the book describes the class C. Therefore, as long as you learn simple C definitions, judgments, and loop statements, you can basically understand all the programs in the textbook.

    3.Once you've done all of the above, start with a linear table of data structures. Sequential tables in linear tables seem to be designed for you to learn the C language, and learning the linked list of linear tables is the key to getting you started.

    The chain structure is indispensable for the tree structure, graph structure, sorting, and searching, and this is often the most difficult.

    4.When looking at the program, you must draw on paper by yourself, and it is best to learn to draw the flowchart of the program first, maybe then you will learn the program faster.

    5.Data structures are the most basic and useful part of programming, and you will benefit a lot after learning it, and maybe this book can determine your future path or destiny.

Related questions
7 answers2024-02-08

The Huffman tree is:

The weighted path length of a tree is the sum of the weighted path lengths of all leaf nodes in the tree, and the weighted path length of a node is the product of the path length from the node to the root node and the weights on the node. >>>More