| 000 -LEADER |
|---|
| fixed length control field |
02065nam a22002057a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20200423120622.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
200422b mp ||||| |||| 00| 0 mon d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780262033848 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
ШМТДС |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Edition number |
22 |
| Classification number |
005.1 |
| Item number |
C-80 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Dates associated with a name |
Thomas H. Cormen |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Indroduction to Algorithms |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Dimensions |
240см. |
| 500 ## - GENERAL NOTE |
|---|
| General note |
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. |
| Title |
The Role of Algorithms in Computing |
| -- |
Probabilisttic Analysis and Randomized Algorithms |
| -- |
Sorting and Order Statistics |
| -- |
Data Structures |
| -- |
Advansed Design and Analysis techniques |
| -- |
Advansed data Structures |
| -- |
Graph Algorithms |
| -- |
Mathematical Background |
| 653 ## - INDEX TERM--UNCONTROLLED |
|---|
| Uncontrolled term |
Algorithms |
| -- |
The Role of Algorithms in Computing |
| -- |
Data Structures |
| -- |
Graph Algorithms |
| -- |
Mathematical Background |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Relator term |
Charles E.Leiserson |
| -- |
Ronald L.Riverst |
| -- |
Clifford Steim |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Koha item type |
Books |
