(This article has not been derived) directory
Chapter 1 Basic Concept 1.1 Algorithm 1.2 Mathematics Preparation 1.2.1 Mathematical Sentence Differentiation 1.2.2 Number, Power and Logarization 1.2.3 and Total 1.2.4 Integral Functions and Elementary Alien 1.2.5 Arrangement and Step by 1.2.6 The number of coefficients 1.2.7 Rumor number 1.2.8 Fiboac deed 1.2.9 Generate function 1.2.10 An algorithm analysis * 1.2.11 Asymptivity * 1.2.11.1 ○ 号 * 1.2.11.2 Eura and formula * 1.2.11.3 Some Asymptotic Calculations 1.3 Mix 1.3.1 Mix 1.3.2 MIX assembly language 1.3.3 Aligned Applications 1.4 Some basic programming technology 1.4.1 Subprogram 1.4.2 Competer 1.4.3 Interpretatory program 1.4.3.1 MIX simulation program * 1.4.3.2 Tracking program 1.4.4 Input and output 1.4.5 history and reference
Chapter 2 Information Structure 2.1 Introduction 2.2 Linear Table 2.2.1 Stack, Queuing and Double Queue 2.2.2 Original Distribution 2.2.3 Link Assignment 2.2.4 Cyclic Table 2.2.5 Double Link Table 2.2.6 Arranges and orthogonal Table 2.3 Tree 2.3.1 Training the binary tree 2.3.2 Tree represents the other representation of the 2.3.4 tree 2.3.4 Tree's basic mathematical properties 2.3.4.1 Free Tree * 2.3.4.2 Tree * 2.3.4.3 "Unlimited Infinity Intrihood" * 2.3.4.4 Tree enumeration 2.3.4.5 Voltage length * 2.3.4.6 History and References 2.3.5 List and waste collection 2.4 Multi-link structure 2.5 Dynamic Storage Assignment 2.6 History and References
Exercise Answer Appendix A Number Index Numerical Number Form 1. Basic constant (10) 2. Basic constants (8 into) 3. Rumor number, Benuilli, Fiboacci number noun and name table
Chapter 1 Basic Concept 1.1 Algorithm For all computer programming, the concept of algorithm is always basic, so we should first analyze this concept at all. The word "algorithm" is very interesting. It seems that this word seems to be the word "logarithm) that someone is going to write but it is reversed before and after the first four letters. During 1957, the WEBSTER's New World Dictionary has not appeared, we can only find the older form "Algorism" with its ancient intentions, refers to The process of arithmetic operation with arabant number. In the Middle Ages, the beads household calculation is calculated, while the arithmetic man is calculated by arithmetic. After the medieval, the origin of this word has already been allowed, and the early linguists tried to infer its origin, think it was derived from the Algiros [Fault] Arithmos [Number], but others People disagree with this statement, think this word is derived from "Cafer King Algor". Finally, mathematics scholars discovered the true origin of the word "algorism": It derived from the famous "Persian Textbook" of the author of Abu Jiafa Muhamad Ibim Musa · Abu Ja'far Mohammed Ibn Musa Alkhowarizml (about 825) - From the literal, it is "Ja, Far's father, Mohammed, Moses son, Khowarizm scholars". KhowarizM is a small town in the city of Soviet, ива. Alkhowarizml wrote a famous book "Restoration and Slim Rules"; another word, "Algebra", is from his title of his book, although this book The book is actually not the number of words. Gradually, "Algorism" form and significance have become unrecognizable. Such as explained in the Oxford English Dictionary, this word is due to the mistakes formed by confused with Arithmetic (arithmetic). Along Algorithm by Algorism. Just understand that people have forgotten the fact that this word is derived, it is not difficult to understand this change. A high German math dictionary "Daquan Mathematisches Lexicon Leipzig, 1747), gives the following definition of the word AlgorithMus:" Under this name, combine four types of arithmetic The concept of calculation, that is, addition, subtraction, multiplication and division. Latin phrase ALGORITHMUS Infinitesimalis (unlimited small algorithm) used to represent "Leibnitz) invented by unlimited small amounts of calculations." Around 1950, the word Algorithm often links with the European miles "Euclid's Algorithm". This algorithm is the process of seeking two numbers of factors in the "Geometric Original" (Euclid's Elements, VII, Propositions I, and II), "Euclid's Elements, Group VII, Propositions I and II). It will also be beneficial: Algorithm E (European Miles Algorithm). The two positive integers M and N are given, and their maximum common factor can be simultaneously removed simultaneously. E1. [Survival] The remainder of the R is the remaining number in N am-divided m (we will have 0 ≤ r ■ Of course, the European miles are not to give his algorithm in this way. The above format fully demonstrates the style of all the books when given all the algorithms in this book. We give each algorithm discussed, a logo letter (such as E) in the upper algorithm is used, and the step of connecting the algorithm with the almense (e.g., E1, E2, etc.). Chapters in the book are divided into compilation, and the algorithm within one section is only identified by the letter; but when references these algorithms in other sections, the corresponding ninth is attached. For example, we are now in Section 1.1; in this section, the European miles are called algorithm E, and when the section behind is referenced, the algorithm 1.1e is recorded. Each step of an algorithm (eg, step E1 on the top begins with a short sentence in a square bracket, and it summarizes the main content of this step as possible. This short sentence usually also appears in a block diagram (e.g., Figure 1) corresponding to this algorithm. With block diagram, the reader will have a process of this algorithm more intuitively. Fig. 1 block diagram of algorithm E After a generally short sentence, a certain action or a certain judge to be executed is a narrative. I also have annotations with parentheses (for example, step E1), which are illustrative information about this step, usually pointing out certain characteristics of variables or current objectives, etc.; annotations with parentheses It does not affect the action belonging to this algorithm, but is just to facilitate the help of readers. (Endlessly)
