For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms.Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen—coauthor of the leading college textbook on the subject—provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems.Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order (“sorting”); how to solve basic problems that can be modeled in a computer with a mathematical structure called a “graph” (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.

motw/Algorithms Unlocked - Thomas Cormen.pdf

Алгоритмы: вводный курс: [перевод с английского]

Cormen, Thomas H.

Томас Х. Кормен

Кормен, Томас

Cambridge, MA : MIT Press, 2013

Вильямс; б. и.

Диалектика

AAAI Press

Москва, Санкт-Петербург, Киев, Russia, 2016

United States, United States of America

Москва, Санкт-Петербург, Russia, 2020

Москва, Санкт-Петербург, Russia, 2018

Cambridge, Mass, Massachusetts, 2013

producers:
Acrobat Distiller 10.1.4 (Macintosh)

Memory of the World Librarian: marcell mars

Includes bibliographical references and index.
Description based on print version record.

Фактическая дата выхода в свет - 2019
Предм. указ.: с. 207-208
Библиогр.: с. 205-206
Пер.: Cormen, Thomas H. Algorithms unlocked Cambridge, Massachusetts ; London, England : The MIT Press, cop. 2013 978-0-262-51880-2

РГБ

Russian State Library [rgb] MARC:
=001 010190972
=005 20191211142409.0
=008 191206s2020\\\\ru\||||\\\\\\|0||\|\rus|d
=017 \\ $a КН-П-19-094192 $b RuMoRKP
=020 \\ $a 978-5-907144-90-3 $c 300 экз.
=040 \\ $a RuMoRGB $b rus $e rcr
=041 1\ $a rus $h eng
=044 \\ $a ru
=084 \\ $a З973.2-018,0 $2 rubbk
=084 \\ $a В127,0 $2 rubbk
=100 1\ $a Кормен, Томас $d 1956-
=245 00 $a Алгоритмы : $b вводный курс : перевод с английского $c Томас Х. Кормен
=260 \\ $a Москва ; $a Санкт-Петербург $b Диалектика $c 2020
=300 \\ $a 208 с. $c 24 см
=336 \\ $a Текст (визуальный)
=337 \\ $a непосредственный
=500 \\ $a Фактическая дата выхода в свет - 2019
=500 \\ $a Предм. указ.: с. 207-208
=504 \\ $a Библиогр.: с. 205-206
=534 \\ $p Пер.: $a Cormen, Thomas H. $t Algorithms unlocked $c Cambridge, Massachusetts ; London, England : The MIT Press, cop. 2013 $z 978-0-262-51880-2
=650 \7 $a Техника. Технические науки -- Энергетика. Радиоэлектроника -- Радиоэлектроника -- Вычислительная техника -- Электронные вычислительные машины (компьютеры) -- Цифровые электронные вычислительные машины. Программирование -- Теория. Исследования -- Программирование $2 rubbk
=650 \7 $a Физико-математические науки -- Математика -- Основания математики. Математическая логика -- Теория алгоритмов, рекурсивные функции $2 rubbk
=852 \\ $a РГБ $b FB $j 2 19-76/19 $x 90
=852 \\ $a РГБ $b FB $j 2 19-76/407 $x 90

Указ.
Библиогр.: с. 205-206
Пер.: Cormen, Thomas H. Algorythms unlocked Cambridge, Massachusetts ; London, England : The MIT Press, cop. 2013 978-0-262-51880-2

Russian State Library [rgb] MARC:
=001 008153239
=005 20211029124204.0
=008 160219s2016\\\\ru\\\\\\\\\\\\0||\|\rus|d
=017 \\ $a 16-13926 $b RuMoRKP
=020 \\ $a 978-5-8459-2073-7 $c 300 экз.
=040 \\ $a RuMoRGB $b rus $e rcr $d RuMoRGB
=041 1\ $a rus $h eng
=044 \\ $a ru
=080 \\ $a 004.4
=084 \\ $a З973.2-018я73-1 $2 rubbk
=084 \\ $a В127я73-1 $2 rubbk
=100 1\ $a Кормен, Томас $d 1956-
=245 00 $a Алгоритмы $h [Текст] : $b вводный курс : [перевод с английского] $c Томас Х. Кормен
=260 \\ $a Москва ; $a Санкт-Петербург ; $a Киев $b Вильямс $c 2016
=300 \\ $a 208 с. $b ил., табл. $c 24 см
=336 \\ $a текст (text) $b txt $2 rdacontent
=337 \\ $a неопосредованный (unmediated) $b n $2 rdamedia
=338 \\ $a том (volume) $b nc $2 rdacarrier
=500 \\ $a Указ.
=504 \\ $a Библиогр.: с. 205-206
=534 \\ $p Пер.: $a Cormen, Thomas H. $t Algorythms unlocked $c Cambridge, Massachusetts ; London, England : The MIT Press, cop. 2013 $z 978-0-262-51880-2
=650 \7 $a Вычислительная техника -- Вычислительные машины электронные цифровые -- Программирование. Алгоритмы -- Учебник для высшей школы $2 rubbk
=650 \7 $a Алгоритмы $x Построение $0 RU\NLR\AUTH\6625727 $2 nlr_sh
=650 \7 $a Физико-математические науки -- Математика -- Основания математики. Математическая логика -- Теория алгоритмов, рекурсивные функции -- Учебник для высшей школы $2 rubbk
=650 \7 $a Алгоритмов теория $0 RU\NLR\AUTH\661349362 $2 nlr_sh
=852 \\ $a РГБ $b FB $j 2 16-17/69 $x 90
=852 7\ $a РГБ $b CZ2 $h З973.2-018/К66 $x 83

Предм. указ.: с. 207-208
Библиогр.: с. 205-206
Пер.: Cormen, Thomas H. Algorythms unlocked Cambridge, Massachusetts ; London, England : The MIT Press, cop. 2013 978-0-262-51880-2

Russian State Library [rgb] MARC:
=001 009677294
=005 20180710131432.0
=008 180704s2018\\\\ru\\\\\\\\\\\\|||\|\rus|d
=017 \\ $a КН-П-18-047862 $b RuMoRKP
=020 \\ $a 978-5-8459-2073-7 $c 300 экз.
=040 \\ $a RuMoRGB $b rus $e rcr
=041 1\ $a rus $h eng
=044 \\ $a ru
=084 \\ $a В127я73-1 $2 rubbk
=084 \\ $a З973.2-018я73-1 $2 rubbk
=100 1\ $a Кормен, Томас $d 1956-
=245 00 $a Алгоритмы $h [Текст] : $b вводный курс : [перевод с английского] $c Томас Х. Кормен
=260 \\ $a Москва $b Вильямс ; $a Санкт-Петербург $b [б. и.] $c 2018
=300 \\ $a 208 с. $b ил., табл. $c 24 см
=336 \\ $a текст (text) $b txt $2 rdacontent
=337 \\ $a неопосредованный (unmediated) $b n $2 rdamedia
=338 \\ $a том (volume) $b nc $2 rdacarrier
=500 \\ $a Предм. указ.: с. 207-208
=504 \\ $a Библиогр.: с. 205-206
=534 \\ $p Пер.: $a Cormen, Thomas H. $t Algorythms unlocked $c Cambridge, Massachusetts ; London, England : The MIT Press, cop. 2013 $z 978-0-262-51880-2
=650 \7 $a Физико-математические науки -- Математика -- Основания математики. Математическая логика -- Теория алгоритмов, рекурсивные функции -- Учебник для высшей школы $2 rubbk
=650 \7 $a Радиоэлектроника -- Вычислительная техника -- Вычислительные машины электронные цифровые -- Программирование -- Учекбник для высшей школы $2 rubbk
=852 \\ $a РГБ $b FB $j 2 18-44/21 $x 90

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked , Thomas Cormen -- coauthor of the leading college textbook on the subject -- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.
Review "Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract topic, without sacrificing depth. This is an important contribution and there is nobody more qualified than Thomas Cormen to bridge the knowledge gap between algorithms experts and the general public." -- Frank Dehne , Chancellor's Professor of Computer Science, Carleton University
"Thomas Cormen has written an engaging and readable survey of basic algorithms. The enterprising reader with some exposure to elementary computer programming will discover insights into the key algorithmic techniques that underlie efficient computation." -- Phil Klein , Professor, Department of Computer Science, Brown University
"Thomas Cormen helps readers to achieve a broad understanding of the key algorithms underlying much of computer science. For computer science students and practitioners, it is a great review of key algorithms that every computer scientist must understand. For non-practitioners, it truly unlocks the world of algorithms at the heart of the tools we use every day." -- G. Ayorkor Korsah , Computer Science Department, Ashesi University College
About the Author Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, * Introduction to Algorithms (third edition, MIT Press, 2009).
Contents 6
Preface 10
1 What Are Algorithms and Why Should You Care? 16
Correctness 17
Resource usage 19
Computer algorithms for non-computer people 21
Computer algorithms for computer people 21
Further reading 23
2 How to Describe and Evaluate Computer Algorithms 25
How to describe computer algorithms 25
How to characterize running times 32
Loop invariants 36
Recursion 37
Further reading 39
3 Algorithms for Sorting and Searching 40
Binary search 43
Selection sort 47
Insertion sort 50
Merge sort 55
Quicksort 64
Recap 72
Further reading 74
4 A Lower Bound for Sorting and How to Beat It 75
Rules for sorting 75
The lower bound on comparison sorting 76
Beating the lower bound with counting sort 77
Radix sort 83
Further reading 85
5 Directed Acyclic Graphs 86
Directed acyclic graphs 89
Topological sorting 90
How to represent a directed graph 93
Running time of topological sorting 95
Critical path in a PERT chart 95
Shortest path in a directed acyclic graph 100
Further reading 104
6 Shortest Paths 105
Dijkstra’s algorithm 107
The Bellman-Ford algorithm 116
The Floyd-Warshall algorithm 121
Further reading 129
7 Algorithms on Strings 130
Longest common subsequence 130
Transforming one string to another 136
String matching 144
Further reading 151
8 Foundations of Cryptography 153
Simple substitution ciphers 154
Symmetric-key cryptography 155
Public-key cryptography 159
The RSA cryptosystem 161
Hybrid cryptosystems 170
Computing random numbers 171
Further reading 172
9 Data Compression 173
Huffman codes 175
Fax machines 182
LZW compression 183
Further reading 193
10 Hard? Problems 194
Brown trucks 194
The classes P and NP and NP-completeness 198
Decision problems and reductions 200
A Mother Problem 203
A sampler of NP-complete problems 205
General strategies 220
Perspective 223
Undecidable problems 225
Wrap-up 226
Further reading 227
Bibliography 228
Index 230
Computerscience,TracingConcepts

This Book Offers An Engagingly Written Guide To The Basics Of Computer Algorithms. In Algorithms Unlocked, Thomas Cormen- Coauthor Of The Leading College Textbook On The Subject- Provides A General Explanation, With Limited Mathematics, Of How Algorithms Enable Computers To Solve Problems. Readers Will Learn What Computer Algorithms Are, How To Describe Them, And How To Evaluate Them. They Will Discover Simples Ways To Search For Information In A Computer; Methods For Rearranging Information In A Computer Into A Prescribed Order (sorting); How To Solve Basic Problems That Can Be Modeled In A Computer With A Mathematical Structure Called A Graph (useful For Modeling Road Networks, Dependencies Among Tasks, And Financial Relationships); How To Solve Problems That Ask Questions About Strings Of Characters Such As Dna Structures; The Basic Principles Behind Cryptography; The Fundamentals Of Data Compression; And Even That There Are Some Problems That No One Has Figured Out How To Solve On A Computer In A Reasonable Amount Of Time. -- Back Cover. What Are Algorithms And Why Should You Care? -- How To Describe And Evaluate Computer Algorithms -- Algorithms For Sorting And Searching -- A Lower Bound For Sorting And How To Beat It -- Directed Acyclic Graphs -- Shortest Paths -- Algorithms On Strings -- Foundations Of Cryptography -- Data Compression -- Hard? Problems. Thomas H. Cormen. Includes Bibliographical References (pages 213-214) And Index.

2025-10-27