로그인회원가입장바구니고객센터마이페이지회사소개
kangcom
전체
Home >   >   > 

Introduction to Algorithms (2/E)

   
지은이 Thomas H. Cormen   |   출판사 MIT PRESS  |   발행일 년 월 일   |   언어 : English
 
클릭하시면 큰 도서이미지를 보실 수 있습니다.
판매가 58,000원55,100원 5%
마일리지 0% 0원
발행일 -- | 중량: 0.02 kg | 사이즈: 0.2*0.3 cm
ISBN 0262531968 | 9780262531962
기타정보 원서 | 1180쪽 | $ 49.95 | Softcover
예상출고일
배송비 무료배송
   
프로그래밍
종합지수 7p 43 위
   
이 책의 번역서
  Introduction to Algorithms (개정판) (2007년 대한민국학술원 우수학술도서)
한빛아카데미(주) | Thomas H. Cormen
 

This paperback edition is not available in the U.S. and Canada.

There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Amazon.com
If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, data structures, graphs, and a variety of selected algorithms including computational geometry, string algorithms, parallel models of computation, fast Fourier transforms (FFTs), and more.

This book's strength lies in its encyclopedic range, clear exposition, and powerful analysis. Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book is a great resource on the basic tools used to analyze the performance of algorithms. --This text refers to an out of print or unavailable edition of this title.

Synopsis
This title 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. This second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.

Book Info
A rigorous and comprehensive volume dedicated entirely to algorithms. Designed to be accessible to users with little or no computer programming background, with explanations in plain English and in a pseudo-programming code. New chapters cover the role of algorithms, probabilistic analysis, and more. Previous edition not cited. Softcover. DLC: Computer programming.

MIT Press
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms 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.

The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning. --This text refers to the Hardcover edition.

준비 중입니다.
Thomas H. Cormen is Assistant Professor in the Department of Computer Science at Dartmouth College. Charles E. Leiserson is Professor and head of the Supercomputing Technologies Group at the Laboratory for Computer Science at MIT. Ronald L. Rivest is the Webster Professor of Electrical Engineering and Computer Science in the Department of Electrical Engineering and Computer Science and Associate Director of the Laboratory for Computer Science at MIT. --This text refers to an out of print or unavailable edition of this title.


알고리즘 시작하는 사람들에겐 별로인듯...
정용욱님이 쓰신 서평보기 I 평점 I 조회수(1540) I 공감 (0) I 블로그
Foundations of Algorithms Using C++ Pseudocode, 3/E 책을 보고 나서 조금 부족한 듯한 느낌이 들어 이책을 보았습니다. 제목대로 알고리즘 기초 정도라고 생각했고 목차를 보니 Data structure 부분도또한 다루어준다길래 구입해서 봤는데지금 마지막 파트를 제외하곤 다 읽어봤는데... 왠지 남는게 없는 책인듯 합니다  일단 알고리즘을 시작하시는 분에게는 Foundations of Algorithms Using C++ Pseudocode, 3/E 을 추천하고 싶네요알고리즘 별로 나눠져있고 C++ 코드...
응용의 기본
김근수님이 쓰신 서평보기 I 평점 I 조회수(887) I 공감 (0) I 블로그
이것만 있으면 세상 모든 알고리즘을 유추해 낼 수 있습니다.
알고리즘의 기본을 알려주는 책.
윤기범님이 쓰신 서평보기 I 평점 I 조회수(1821) I 공감 (0) I 블로그
프로그래밍을 짤 때 처음에 어떻게 시작하십니까?무턱태고 main() 부터 써넣기 시작하십니까?실제로 코딩은 프로그래밍에서 크게 중요한 기술이 아닙니다.문제를 컴퓨터로 어떻게 해결해 나갈 것인가 디자인을 짤 수 있는 능력이야말고 중요한 것이지요. 그러나 기존의 알고리즘 책들은 알고리즘 자체를설명하는 수준 밖에 안 됩니다. 그런책들을 보더라도 다이나믹 프로그래밍이 무엇인지는 알겠지만 또는 minimum sppanning tree 를 어떻게 찾는지 알 수 있겠지만과연 현실의 어떤 문...
이 책을 제대로 이해하신다면..
조성원님이 쓰신 서평보기 I 평점 I 조회수(1326) I 공감 (0) I 블로그
이 책의 판매 순위가 꽤 높네요. 꽤 비싼 책임에도 불구하고 워낙 유명한 책이어서 그런가 보네요. 이 책을 제대로 이해하실 수 있다면... 특히나 다이내믹 프로그래밍쪽... 스스로 알고리즘쪽에 대해 어느 정도 자신을 갖으셔도 되지 않을까 싶네요. 교재로 계속 원서를 써왔습니다만, 이 책보다 어렵게 쓰여진 책은 보지 못했던 듯...^^; 물론 저의 실력이 부족해서 이겠지만 쉽지만은 않은 건 확실한 것 같습니다.  
프로그래머처럼 생각하기...
안톤 스프라울
선택된 상품을 찜하실 수 있습니다. 선택된 상품을 바로구매 하실 수 있습니다.
 
전체평균(69)
회원평점   회원서평수 4
알고리즘 시작하는 사람들에겐 별로인듯...
정용욱 님  2007-02-27
응용의 기본
김근수 님  2006-02-25
알고리즘의 기본을 알려주는 책.
윤기범 님  2005-03-12
이 책을 제대로 이해하신다면..
조성원 님  2004-08-27
Charles E. Leiserson 의 최근 저서
 
Mathematics of Big Data: Spreadsheets, Databases, Matrices, and Graphs
103,000원
(8%↓+1%)
 
Thomas H. Cormen 의 최근 저서
 
Algorithmen - Eine Einfuhrung
122,300원
(16%↓+1%)
 
Charles E. Leiserson 의 최근 저서
 
Algorithmen - Eine Einfuhrung
122,300원
(16%↓+1%)
 
Thomas H. Cormen 의 최근 저서
 
Algorithms Demystified
36,100원
(14%↓+0%)
 
Studyguide for Introduction to Algorithms by Thomas H. Cormen, ISBN 9780262033848
47,600원
(8%↓+1%)
 
MIT PRESS 출판사의 신간
Human Language: From Genes and Brains to Behavior
Peter Hagoort 저
193,200원
(8%↓+1%)
 
Radical Virtuosity: Ana Mendieta and the Black Atlantic
Genevieve Hyacinthe 저
43,100원
(23%↓+1%)
 
Fire, Ice, and Physics: The Science of Game of Thrones
Sean Carroll 저
26,900원
(23%↓+1%)
 
Beyond the Valley: How Innovators Around the World Are Overcoming Inequality and Creating the Technologies of Tomorrow
Ramesh Srinivasan 저
32,300원
(23%↓+1%)
 
Innovation + Equality: How to Create a Future That Is More Star Trek Than Terminator
Lawrence H. Summers 저
26,900원
(23%↓+1%)
 
이메일주소수집거부