Stanford Algorithms 笔记@TOC
Divide & Conquer Algorithms
- Brute force: O( n 2 n^2 n2) time
- Better methods:
a. Divide and conquer:
1. We call an inversion ( i , j ) (i,j) (i,j) with [ i < j ] [i < j] [i<j]:
- left if i , j ≤ n 2 i,j \le \frac{n}{2} i,j≤2n
- right if i , j > n 2 i,j > \frac{n}{2} i,j>2n
- split if i ≤ n 2 < j i \le \frac{n}{2} < j i≤2n<j
2. psedocode:
- Count (Array A A A, length n n n)
- if n = 0 → \rightarro