软件技巧基础常识(国外英文资料).docVIP

软件技术基础知识(国外英文资料) Basic knowledge of software technology The first chapter The characteristics of algorithms and algorithms Data structure: a collection of data elements associated with each other. Data structures are divided into logical structures and physical structures. Logical structure: represents the logical relationship of data (back and forth). According to the logical relationship, the linear structure and the non-linear structure. Physical structure: the form of storage that represents data on a computer, also known as storage structure. The storage and chain storage are sorted in different forms. The condition of the line structure: Linear structures are usually called linear tables. A linear table of sequential storage is called a sequence table, and a linear list of chained stores is called a linear list. The data structures that are either linear or non-linear can be either linear or non-linear. The characteristics of sequence tables and linear linked lists. The characteristics of stacks and queues. Stacks and queues can be stored sequentially or in chains. Bi-directional linked lists and loop queues. Tree and binary tree The basic properties of the binary tree The maximum number of nodes in the k layer. A binary tree with depth of k has the highest number of nodes. The relation of any binary tree to the number of nodes with a value of 2. The characteristics of the binary tree. The characteristics of a complete binary tree. The traversal of the binary tree In order to find the applicable situation. Look for the number of times you need to find the worst case in order of a linear table of length n. Binary search for the applicable conditions. To find the worst case for the worst case of a linear table with length n. The classification of sorts. Exchange class sorting: bubble sort, the worst case you need to compare. Insertion sort method, heap sort method. The second chapter 1, the good habit of programming requirements: according to the need to add th