1.1 What is a data structure
Basic concepts and terminology 1.2
1.3 represents the realization of abstract data types
1.4 algorithm and algorithm analysis
1.4.1 Algorithm
1.4.2 algorithm design requirements
Algorithm efficiency measure 1.4.3
1.4.4 algorithm storage
1.1 What is a data structure
In general, a solution to a specific problem with the computer, generally need to go through several steps:
1. First question from a specific abstract an appropriate mathematical model
2. This algorithm is then designed a mathematical model solution
3. Finally compile the program, test, adjust until a final answer
Seeking the essence of the mathematical model is to analyze the problem, the object of the operation to extract and identify the relationship between these operations contains objects, then be described using the language of mathematics.
In 1968 Professor Don O. Canute United States created a "data structure" of the initial system, his book "Computer design skills," Volume I "The basic algorithm" is the first logical structure and store this data set forth systematically structure and operation of the works. From the late 1960s to the early 1970s, there has been large-scale program, the software is relatively independent, structural programming has become the main content of the software development process, people more and more attention "data structure" that is the essence of programming to determine the question to choose a good structure, coupled with a good algorithm design.
Algorithms + data structures = programs
Basic concepts and terminology 1.2
Data (data) is a general term for a symbol objective things. In computer science refers to all symbols for input into a computer program and a computer processing the general term (information carrier) . It is a computer program of processing "raw material." For example, a numerical analysis program using Algebraic equations, which are processed integers and real numbers; processed a word processing program or compiler is a string. Therefore, computer science, the meaning of the data is extremely broad, such as images, sounds, etc. can all be attributed to the category and data by encoding.
Data element (data element) is the basic unit of data, it is typically considered as a whole and processed in a computer program. Sometimes, a data element may be a number of data items (data item) composed of, for example, a book bibliographic information for a data element, and each of a bibliographic information (e.g., title, author name, etc.) of a data item . Data item is indivisible minimum unit of data (which has an independent meaning).
Data object (data object) is a collection of data elements of the same nature, it is a subset of the data. For example, integer data object is a collection of N = {0, ± 1, ± 2, ...}, alphabetic character data object is a collection C = { 'A', ' B', ..., 'Z'}.
Data structure (data structure) is the presence of one or more data elements of the particular relationship between each set. In any problem, the data elements are not isolated, but there is a relationship between them, the relationship between this data element called each other structure (structure). Depending on the characteristics of the relationship between data elements, usually there are four kinds of the basic structure:
(1) set between data elements in addition to the relationship between structure "belong to a set," and nothing other relationships;
(2) linear structure there is a relationship between data elements of a structure; (the relationship between elements is 1: 1)
(3) the tree there is a relationship between a plurality of data elements of the structure;
(4) FIG structure or mesh structure there is a relationship between a plurality of data elements of a plurality of structures.
It is defined as data structures: a tuple data structure is
Data_Structure=(D,S)
Wherein, D is a finite set of data elements, S is a finite set of relations on D. (D data objects, S is a finite set of relationships between the objects of each data element)