Data Structure tutorial (Java description) edited by Xu xiaokai-review abstract 01

Chapter 1 Introduction

The data storage structure can be summarized:Ordered Structure, link structure, hash structure, and index structureFour.

Data StructureIt refers to the relationship (logical relationship) between indexes and their data ). The interconnection between data is called the dataLogical structure.

The logical structure of data is divided into four types: collection structure, linear structure, tree structure, and graph structure.

Linear Relationship-> linear structure, hierarchical relationship-> tree structure, mesh relationship-> graphic structure,

Data types can be classified into simple type and structure type.

There is a difference between "type" and "value" between simple type and structure type. "type" is an abstract definition of "value, any data in a data type is called a value in this type, or an instance.

Abstract data types are composed of a group of data and an operation set on the group of data.

A Data Object is called an object. It belongs to a specific instance of a data type.

AlgorithmIs to solve the specific problem of ideas and methods, an algorithm can use text narration, can also use the traditional flow chart, N-S diagram or pad diagram description, but to achieve on the computer, in the end,ProgramDesign Language. Five features

1. Poor

2. Certainty

3. Feasibility

4. Input

5. Output

Algorithm evaluation five performance indicators

1. Correctness

2. Robustness

3. Readability

4. Time complexity is also known as computing complexity.

5. Space complexity

4 and 5 are collectively referred to as validity.

 

In the collection structure, no order between data is considered. They are independent of each other. Linear Structure (), tree structure (1: Multiple), and graph structure (multiple: Multiple)