Stanford Algorithms 斯坦福算法课

Stanford Algorithms 笔记@TOCjavascript 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 ]

>>阅读原文<<