دانلود کتاب طراحی الگوریتمها clrs+حل المسائل+Introduction to Algorithms

دانلود کتاب طراحی الگوریتمها clrs+حل المسائل+Introduction to Algorithms

Introduction 3
1 The Role of Algorithms in Computing 5
1.1 Algorithms 5
1.2 Algorithms as a technology 10
2 Getting Started 15
2.1 Insertion sort 15
2.2 Analyzing algorithms 21
2.3 Designing algorithms 27
3 Growth of Functions 41
3.1 Asymptotic notation 41
3.2 Standard notations and common functions 51
4 Recurrences 62
4.1 The substitution method 63
4.2 The recursion-tree method 67
4.3 The master method 73
 4.4 Proof of the master theorem 76
5 Probabilistic Analysis and Randomized Algorithms 91
5.1 The hiring problem 91
5.2 Indicator random variables 94
5.3 Randomized algorithms 99
 5.4 Probabilistic analysis and further uses of indicator random variables

6 Heapsort 127
6.1 Heaps 127
6.2 Maintaining the heap property 130
6.3 Building a heap 132
6.4 The heapsort algorithm 135
6.5 Priority queues 138
7 Quicksort 145
7.1 Description of quicksort 145
7.2 Performance of quicksort 149
7.3 A randomized version of quicksort 153
7.4 Analysis of quicksort 155
8 Sorting in Linear Time 165
8.1 Lower bounds for sorting 165
8.2 Counting sort 168
8.3 Radix sort 170
8.4 Bucket sort 174
9 Medians and Order Statistics 183
9.1 Minimum and maximum 184
9.2 Selection in expected linear time 185
9.3 Selection in worst-case linear time 189

.


آدرس url لینک دانلود کتاب طراحی الگوریتمها clrs

http://uploadboy.me/364c1ht59ise/CLRS.zip.html


لینک دانلود حل المسائل طراحی الگوریتمها clrs

http://uploadboy.me/urlerrsl1n83/CLRS_Solution.zip.html


file pass- رمز فایل:    www.fooji.ir