算法期末参考（Algorithm final reference）.docVIP

算法期末参考（Algorithm final reference） 1. Divide-and-conquer method: * * algorithm thinking * * * * decomposes a problem of size n into k smaller subproblems that are independent and identical to the original problem. * * solve this k sub problem separately. If the size of the subproblem is still not small enough, then it can be divided into k sub problems, so the recursion goes on, until the problem is small enough to solve the problem. * * the solution of the small scale problem will be merged into a solution of a larger problem, and the solution of the original problem will be obtained from the bottom up. Non recursive algorithm for binary search Public static int binarySearch (int a [], int x, int n) {/ / in a [0] = a [1] =... = a [n-1] search for x and return it when x is found / / in the array, returns -1 Int left = 0; Int right = n - 1; While (left = right) { Int mid = (left + right) / 2; If (x = = a (mids)) return mid; / / find return position mid? If (x (mids) a) left = mid + 1; / / narrowing the range The else right = mid - 1; / / narrowing the range } The return - 1; / / not found x } Recursive algorithm for binary search Int? Binary (int? A [], int? Left,? Int? Right? Int? X) / / Binary recursive lookup { ???? Int? Mid? =? (left + right) / 2; ???? If? (left? ? Right? The return? - 1; / / not found???? ???? If? (a/mid? = =? X)? ? The return? Mid; / / just find it? ???? The else? If? (a (mids)? ? X)? / / smaller than the middle element, recursively find the left array ?????????? The return? Binary (a, left,? Mid - 1,? X); ???? Else?? / / larger than the middle element, recursively find the right array ?????????? The return? Binary (a, + 1, mid? Right? X); } 2. Dynamic planning: * * algorithm thinking * * * * dynamic programming algorithm is similar to the divide-and-conquer method, and its basic idea is to decompose the problem into several sub-problems But the decomposed subproblems tend not to be independent of each other. The number of different subprob