20,182,313 2019-2020-1 "Object-oriented programming and data structures" Experiment 7 report
Course: "Programming and Data Structures"
Class: 1823
Name: Liu Yao
Student ID: 20182313
experiments Teacher: Johnny
experiment Date: November 1, 2019
Compulsory / Elective: Compulsory
1. Experimental content
Sorting and Searching 1. Define a class and implement linearSearch, SelectionSort class methods, and finally to complete the test.
Test requires less than 10, the design submitted test cases (normal, abnormal, boundary, positive sequence, reverse), the data to be included with the embodiment student number four after their
submission operation result of FIG.
2. refactor your code
to Sorting.java Searching.java into cn.edu.besti.cs1823 (initials + four-digit student number) package. (Example: cn.edu.besti.cs1823.G2301)
to put the test package test code
to recompile, run the code, submit to compile, run shots (IDEA, a command line)
3. Reference http://www.cnblogs.com/maybe2030/p/4715035.html, learn a variety of search algorithm search algorithm in adding Searching and test
submit screenshots operating results
4. The method of sorting talked supplement to achieve lesson: Hill sort, heap sort, binary tree sorting (at least three)
algorithm (normal, abnormal, boundary) test implementation of the
submitted operating results shots (If you write more sorting algorithms, even if three sorting program flawed, as appropriate, may also get full marks)
5. Android app to achieve a variety of sorting algorithms to find and test the
submission run results screenshot
push code to the code cloud (elected to do, points)
2. Experimental procedure and results
3. Experimental problems encountered in the process and settlement process
- One problem: the virtual machine problems at the completion of the second question, quote Give root password for maintenance (or type Control-D to continue): wrong, get in the main interface
- A problem-solving process: according to the Internet taught using fsck command annotation method failed disk after the operation reboot, but did not use. . . Finally, only reinstall the virtual machine to complete experiments
- Second problem: the completion of the pilot seasons understanding is not deep enough to shell sort, and the interval for the difference between understanding it sort of is not enough depth.
- Second problem solving process: Shell sort is a digital sequence at regular intervals into a plurality of subsequences, insertion sort in sequence, and then merge into a digital sequence; and then to reduce the length of the interval, again and again, until the final interval 1 is achieved when ordered; interval sorting to do is start from the very beginning elements, these elements, the large on the back, after a sort, the interval for the collection of elements from the constitution is not necessarily in order.
Sentiment
The completion of the experiment in general, not a lot of problems because of the current knowledge of science is not good enough, but because of prior knowledge forgotten too quickly, as if in a second subject required to operate within a virtual machine, a lot of vim command actually I have forgotten, before the teacher had the ability to turn out to re-learn tutorial released again, this experiment often remind me later to review previously learned knowledge, to lay a solid foundation.