Algorithm Study Notes

0.Master Method 时时勤拂拭

Master Theorem 

Let a ³ 1 and b > 1 be constants, let f(n) be a function, and let T(n) be defined as the nonnegative integers by the recurrence

T(n) = aT(n/b) + f(n),

where we interpret n/b to mean either ën/bû or én/bù. Then T(n) can be bounded asymptotically as follows

1. If f(n) = O(n^{log_b a - e}) for some constant e > 0, then T(n) = Q(n^log_b a).
2. If f(n) = Q(n^{log_b a - e}), then T(n) = Q(n^log_b a lgn).
3. If f(n) = W(n^{log_b a + e}) for some constant e > 0, and if af(n/b) £ cf(n) for some constant c < 1 and all sufficiently large n,then T(n) = Q(f(n)).

Chapter 5. Random Algorithm

HIRE_ASSISTANT(n) {
1    best = 0; // candidate 0 is a least-qualified dummy candidate
2    for i = 1 to n {
3        interview candidate i;
4        if candidate i is better than candidate best {
5            best = i;
6            hire candidate i;
7        }
8    }
}

RANDOMIZED_HIRE_ASSISTANT(n) {
1    randomly permute the list of candidates
2    HIRE_ASSISTANT(n)
}

RANDOMIZE_IN_PLACE(A) {
1    n = A.length;
2    for i = 1 to n
3        swap(A[i], A[RANDOM(i, n)]);
}

Expected Cost for hire = O(c_h*ln(n))