Description: Comprehensive summary of sequence: sort comprehensive is the use of random functions to generate random integer N (2000 above), the number of these sort a number of ways. The design of the three sequencing methods used, that is, insertion sort, sort and HEAPSORT Hill. We will design this design problem, the system function of the completion of a detailed description, and discusses the design of design ideas, methods and programs, but also the design of software test data and test results pasted up, and test methods a detailed description. Finally, there is software designed for self-evaluation. Keywords: design thinking method of functional testing
To Search:
- [reportjgj] - This is a fraction of the games statisti
- [hosthook] - COM ports on the note, how to use COM po
- [hafumanbianyiqi] - This is a compiler Huffman, I studied th
- [rand1] - Insertion Sort test average run time 1)
- [TheSmallestTree] - err
- [shoupiaoxitong] - Ticket service system--- query routes, b
- [paixu] - (1) of the following six kinds of common
- [main] - Using random functions to generate 30,00
File list (Check if you may need any files):
Download