Combination Algorithm And Realization

With the twenty-first century's coming of the information society, the computers have already apply to many kinds of areas in the society , on the whole, which is basically completed by the software, at the same time, the core of the software development and designment is the designment and realization of the arithmetics, finally, combination arithmetics constitute the core of the computer arithmetics. From the development state of the economy and the software, America is on the hegemony state. By it, we can indirectly see the importance of the combination arithmetics, not only the nowadays, but also the future, which have testified by the practice.The thesis researchs several basic arithmetics of the combination arithmetics. Firstly, it analyzes the historical background and the meaning of research; Secondly, it puts forward the non- recursive algorithm on the chessBoard polynomial, and compares with the other arithmetics, as a result, the non- recursive algorithm improves three to five times on the speed; Thirdly, it researchs three other basic arithmetics of the combinatorics: derangement, partition of the positive integer, arrangement and combination, makes some betterments and compare simultaneously; Then, it realizes and integrates the above arithmetics, which are formed a software of the combination arithmetics; Finally, it summarizes all the researchs, and provides the next goals aiming at the current problems.To sum up, the research on the combination arithmetics has the academic significance and the applicability, especially to the the non- recursive algorithm on the chessBoard polynomial, which not only has a obvious improvement on the speed, but also gives the total and the material scheme at the same time, all of them make the operation more conveniently and fast.