------------ ------------ restore content begins
20,182,318 2019-2020-1 "Object-oriented programming and data structures" from the test report
Course: "Programming and Data Structures"
Class: 1823
Name: Wang Australian
Student ID: 20182318
experiments Teacher: Johnny
experiment Date: November 2, 2019
Compulsory / Elective: Compulsory
1. Experimental content
- Searching and Sorting define a class, and implements linearSearch, SelectionSort class methods, and finally to complete the test.
- Refactor your code
- Find a variety of learning algorithms and added search algorithm and test Searching
Sorting method talked about the realization of supplementary lesson: Hill sort, heap sort, binary tree sorting (at least 3)
Android app to find and implement various sorting algorithms for testing2. Experimental procedure and results
experiment one
- The second experiment
- Third experiment
Experiment 4
3. Experimental problems encountered in the process and settlement process
- Question 1: Question 1: When using the command line can not call package
- Problem 1 Solution: Change the path, all the code in a folder, you can run normally
- Question 2: What is Bofei Fibonacci Find
Problem 2 Solution: Find first start with that deed Fibonacci number column. Fibonacci column from the beginning of paragraph 3, each of which is equal to the sum of the first two. I.e., F (n) = F (n -1) + F (n-2).
Fibonacci Find: Find also called the Golden Section. That is, on the basis of binary search is divided according to the Fibonacci columns. In deed Fibonacci number of columns that is equal to slightly greater than the lookup to find a number of elements in the table the number of F [n], the original length of the lookup table is extended the Fn, the divided Fibonacci be completed, i.e., F [n] elements It is divided into a front half F [n-1] element, the latter half of F [n-2] elements, to find to find the element in that part and recursively, until it finds.Other (perception, thinking, etc.)
java language or very difficult, and I think not so simple. Many of operation is very complex and requires a multi-computer lab
2. teacher in the class and soon, a lot of content difficult. This requires that I must seize every bit of time to learn.Reference material
"Java programming and data structures Course (Second Edition)"
- "Java programming and data structures Course (Second Edition)" Study Guide
...
------------ ------------ recover the contents end20,182,318 2019-2020-1 "Object-oriented programming and data structures" from the test report
Course: "Programming and Data Structures"
Class: 1823
Name: Wang Australian
Student ID: 20182318
experiments Teacher: Johnny
experiment Date: November 2, 2019
Compulsory / Elective: Compulsory
1. Experimental content
- Searching and Sorting define a class, and implements linearSearch, SelectionSort class methods, and finally to complete the test.
- Refactor your code
- Find a variety of learning algorithms and added search algorithm and test Searching
Sorting method talked about the realization of supplementary lesson: Hill sort, heap sort, binary tree sorting (at least 3)
Android app to find and implement various sorting algorithms for testing2. Experimental procedure and results
experiment one
- The second experiment
- Third experiment
Experiment 4
3. Experimental problems encountered in the process and settlement process
- Question 1: Question 1: When using the command line can not call package
- Problem 1 Solution: Change the path, all the code in a folder, you can run normally
- Question 2: What is Bofei Fibonacci Find
Problem 2 Solution: Find first start with that deed Fibonacci number column. Fibonacci column from the beginning of paragraph 3, each of which is equal to the sum of the first two. I.e., F (n) = F (n -1) + F (n-2).
Fibonacci Find: Find also called the Golden Section. That is, on the basis of binary search is divided according to the Fibonacci columns. In deed Fibonacci number of columns that is equal to slightly greater than the lookup to find a number of elements in the table the number of F [n], the original length of the lookup table is extended the Fn, the divided Fibonacci be completed, i.e., F [n] elements It is divided into a front half F [n-1] element, the latter half of F [n-2] elements, to find to find the element in that part and recursively, until it finds.Other (perception, thinking, etc.)
java language or very difficult, and I think not so simple. Many of operation is very complex and requires a multi-computer lab
2. teacher in the class and soon, a lot of content difficult. This requires that I must seize every bit of time to learn.Reference material