- 博客(5)
- 收藏
- 关注
RSS订阅原创 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
418
原创 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
473
原创 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
619
原创 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
757
原创 STL Function Objects
STL Function Objects mem_fun & mem_fun_ref Test code: void foo (const std::vector& coll) { using std::for_each; using std::bind2nd; using std::mem_fun_ref;
2013-12-03 11:01:27
539
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人