算法导论
文章平均质量分 74
手机开发工作者
这个作者很懒,什么都没留下…
展开
-
Introduction: Analysis of Algorithms, Insertion Sort, Merge Sort
Sorting: The problem of sorting: Input: sequence output: permutation such that a1' Inserting sort: 1)think at index j, the sequence of the left index of j is sorted. 2)we insert j to the l原创 2013-12-12 16:53:20 · 783 阅读 · 0 评论 -
Asymptotic Notation and Recurrences
Asymptotic notation Θ-notation Θ(g(n)) = {f(n) : there exist positive constants c1, c2, and n0 such that 0 ≤ c1g(n) ≤ f(n) ≤ c2g(n) for all n ≥ n0} O-notation O(g(n)) = {f(n): there exis原创 2013-12-16 17:06:19 · 651 阅读 · 0 评论 -
Divide and conquer
Categroy: 1.Binary search 2.Powering a number 3.Fibonacci numbers 4.Matrix Multiplication 5.Starass's algorithem 1.Binary search master thorem T(n) = aT(n/b) +f(n) CASE 1:原创 2013-12-17 17:13:05 · 502 阅读 · 0 评论 -
QuickSort
I.Description of quicksort Quicksort, like merge sort, is based on the divide-and-conquer paradigm introduced in Section 2.3.1. Here is the three-step divide-and-conquer process for sorting a typic原创 2013-12-24 16:20:54 · 449 阅读 · 0 评论