Normal view MARC view ISBD view

Introduction to algorithms/ Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.

By: Cormen, Thomas HContributor(s): Leiserson, Charles Eric | Rivest, Ronald LMaterial type: Text

TextSeries: The MIT electrical engineering and computer science seriesPublication details: Cambridge, Mass. : New York : MIT Press ; McGraw-Hill, 1990Description: xvii, 1028 p. : ill. ; 26 cmISBN: 0262031418; 0070131430 (McGrawHill)Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1

Contents:

The Role of Al^algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology (letting Started 16 2.1 Insertion sort 16 2.2 Analysing algorithms 23 2.3 Designing algorithms 29 Growth of Functions ^3 3.1 Asymptotic notation 43 3.2 Standard notations and common functions Divide-and-Conquer 65 4.1 The maximum-subarray problem 68 4.2 Strassen's algorithm for matrix multiplication 75 4.3 The substitution method for solving recurrences 83 4.4 The recursion-tree method for solving recurrences 88 4.5 The master method for solving recurrences 93 4.6 Proof of the master theorem 97 Probabilistic Analysis and Randomized Algorithms 114 5.1 The hiring problem 114 5.2 Indicator random variables JI8 5.3 Randomized algorithms 722 5.4 Probabilistic analysis and further uses of indicator random

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Date due	Barcode	Item holds
General Books	Central Library, Sikkim University	005.1 COR/I (Browse shelf(Opens below))	Available		P18475

Total holds: 0

Includes bibliographcal references (p. [987]-996) and index.

The Role of Al^algorithms in Computing 5
1.1 Algorithms 5
1.2 Algorithms as a technology
(letting Started 16

2.1 Insertion sort 16
2.2 Analysing algorithms 23
2.3 Designing algorithms 29
Growth of Functions ^3

3.1 Asymptotic notation 43
3.2 Standard notations and common functions
Divide-and-Conquer 65

4.1 The maximum-subarray problem 68
4.2 Strassen's algorithm for matrix multiplication 75
4.3 The substitution method for solving recurrences 83
4.4 The recursion-tree method for solving recurrences 88
4.5 The master method for solving recurrences 93
4.6 Proof of the master theorem 97
Probabilistic Analysis and Randomized Algorithms 114

5.1 The hiring problem 114
5.2 Indicator random variables JI8
5.3 Randomized algorithms 722
5.4 Probabilistic analysis and further uses of indicator random

There are no comments on this title.

to post a comment.