weixin_42644110的博客

原创 Stanford Algorithms 斯坦福算法课

Stanford Algorithms 笔记@TOC Divide & Conquer Algorithms Brute force: O(n2n^2n2) time Better methods: a. Divide and conquer: 1. We call an inversion (i,j)(i,j)(i,j) with [i<j][i < j][...