计算机专业外文翻译---visualbasic语言与算法(编辑修改稿)

计算机专业外文翻译---visualbasic语言与算法(编辑修改稿)内容摘要：

utive program (eyeful), Can carry out this file directly after this. In produce, + executive program, and then through install guide bale all associated documents, Can run independently after installation under the environment of windows 9 x/2020 as a software product. In puter system39。 s any software, is by the every large or small each kind of software constituent constitution, defers to the specific algorithm to realize respectively, the algorithm quality direct decision realizes the software performance fit and unfit quality. Designs the algorithm with any method, what resources designs the algorithm to need, requires how many running time, how many storage space, how to determine an algorithm the quality, when realizes a software, is must give to solve. In puter system39。 s operating system, the language piling system, the database management system as well as in various puter application system39。 s software, must use each one concrete algorithm to realize. Therefore, the algorithm design and the analysis are the puter science and a technical core question. The algorithm is the problemsolving step, we may define the algorithm Cheng Jie a determination class question the random one special method. In the puter science, the algorithm needs to use the puter algorithmic language to describe, the algorithm represents with the puter solves a kind of question precisely, the effective method. The algorithm construction of data = procedure, solves one to assign may calculate or the solvable question, the different person may pile the different procedure, solves the identical problem, here has two problems: First, with putational method close related algorithm question。 Second, programming technical question. Between the algorithm and the procedure has the close relationship. The algorithm is a group has the poor rule, they had stipulated solves some specific type question a series of operations, is to the problem solving plan accurate and the plete description. Formulates an algorithm, generally must pass through stages and so on design, confirmation, analysis, code, test, debugging, time. To algorithm study including five aspect contents:① Design algorithm. The algorithm design work is impossible pletely the automation, should study the understanding already by the practice to prove that was the useful some basic algorithm design method, these basic design method was not only suitable for the puter science, moreover was suitable for domains and so on electrical engineering, operations research。 ② Expresses the algorithm. The description algorithm39。 s method has many kinds of forms, for example the natural language and the algorithmic language, have the suitable environment and the characteristic respectively。 ③ Confirms the algorithm. The algorithm confirmed the goal is causes the people to believe firmly that this algorithm can work unmistakably correctly, namely this algorithm has the circularity. The correct algorithm describes with the puter algorithmic language, constitutes the puter program, the puter program moves on the puter, obtains the algorithm operation result。 ④ Parsing algorithm. The algorithmic analysis is requires how many puting time and the storage space to an algorithm makes the quota the analysis. The parsing algorithm may forecast that what environment this algorithm does suit in moves effectively, to solves the identical question different algorithm validity to make the parison。 ⑤ Confirmation algorithm. With machine language description algorithm whether can calculate effectively, reasonable, must carry on the test to the procedure, the test order work and makes the space and time distribution map by the debugging to be posed. But the algorithm has certain characteristic, it includes:① Determinism. Algorithm each kind of operation must have the determination significance, this kind of operation should carry out what kind of movement should not to have the ambiguity, the goal is clear。 ② Effectiveness. Requests the operation which in the algorithm waits for realizing is basic, each kind of operation can at least pletes in the principle by the human with the paper and the pen in the limited time。 ③ Input. An algorithm has 0 or the many inputs, before the algorithm operation starts gives the algorithm to need the data the starting value, these inputs are from the specific object set。 ④ Output. Does for the algorithm operation result, an algorithm has or many outputs, the output has some kind of specific relational quantity with the input。 ⑤ Has poor. An algorithm always after carrying out had the poor step operation has terminated, namely this algorithm was may reach. Satisfies a first four charact。