Analysis of Algorithms笔记一

I.Reduction

Convert a problem to something you already know how to solve.

1.Brute Force

Wikipedia:

Proof by exhaustion, also known as proof by cases, proof by case analysis, complete induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equivalent cases and each type of case is checked to see if the proposition in question holds.This is a method of direct proof. A proof by exhaustion contains two stages:

1. A proof that the set of cases is exhaustive; i.e., that each instance of the statement to be proved matches the conditions of (at least) one of the cases.
2. A proof of each of the cases.

The prevalence of digital computers has greatly increased the convenience of using the method of exhaustion. Computer expert systems can be used to arrive at answers to many of the questions posed to them. In theory, the proof by exhaustion method can be used whenever the number of cases is finite. However, because most mathematical sets are infinite, this method is rarely used to derive general mathematical results.

百度（大白话）：

BF算法是一种蛮力/暴力/穷举算法。

2.Divide and conquer

Wikipedia:

In computer science, divide and conquer is an algorithm design paradigm based on multi-branched recursion. A divide-and-conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly.