[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-326694-105":59,"doc-detail-326694-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","introduction-to-algorithms-2nd-ed-preface","Introduction to Algorithms - 2nd ed - Preface","","A comprehensive introduction to modern computer algorithms designed for students and technical professionals. The preface explains that the book presents many algorithms with accessible design and analysis, using readable English and pseudocode, and includes extensive figures, careful running-time analysis, bibliographical references, and an index. It emphasizes course flexibility with relatively self-contained chapters, supports both undergraduate and graduate study, and includes a large set of exercises and problems. The second edition updates the entire text with new chapters and revisions.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/introduction-to-algorithms-2nd-ed-preface/326694/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/introduction-to-algorithms-2nd-ed-preface/326694.png","ImageObject",300,407,{"name":92,"@type":93},"Liam","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-05","2026-09-21",true,{"@type":102,"interactionType":103,"userInteractionCount":39},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is the purpose of this book as described in the preface?","Question",{"text":112,"@type":113},"It provides a comprehensive introduction to the modern study of computer algorithms, presenting algorithms with accessible design and analysis across different levels of readers.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How are chapters and sections intended to support teaching and learning?",{"text":117,"@type":113},"Chapters are designed to be relatively self-contained, with section boundaries marking natural stopping points, allowing instructors to choose what to cover in a course.",{"name":119,"@type":110,"acceptedAnswer":120},"What prerequisites does the preface say are needed to read the book?",{"text":121,"@type":113},"The preface indicates readers should have programming experience (including recursive procedures and basic data structures) and some facility with proofs by mathematical induction, with a few portions relying on elementary calculus knowledge.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},326694,1790147398,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":39,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":4},8796095461564,"https://ap-avatar.wpscdn.com/davatar_155a257f0dc6eb9ab79c44ca47cae57d","Introduction to Algorithms, Second Edition  \nThomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein The MIT Press  \nCambridge , Massachusetts London, England McGraw-Hill Book Company  \nBoston Burr Ridge , IL Dubuque , IA Madison , WI New York San Francisco St. Louis Montréal Toronto  \nThis book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution agreement with the McGraw-Hill Book Company.  \nOrdering Information:  \nNorth America  \nText orders should be addressed to the McGraw-Hill Book Company. All other orders should be addressed to The MIT Press.  \nOutside North America  \nAll orders should be addressed to The MIT Press or its local distributor. Copyright © 2001 by The Massachusetts Institute of Technology First edition 1990  \nAll rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.  \nThis book was printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data  \nIntroduction to algorithms / Thomas H . Cormen ... [et al . ] .-2nd ed .  \n[p. cm](p. cm) .  \nIncludes bibliographical references and index .  \nISBN 0-262-03293-7 (hc.: alk. paper, MIT Press).-ISBN 0-07-013151-1 (McGraw-Hill)  \n1. Computer programming. 2. Computer algorithms. I. Title: Algorithms. II. Cormen, Thomas H.  \nQA76 .6 I5858 2001  \n005.1-dc21  \n2001031277  \nPreface  \nThis book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor.  \nEach chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a \"pseudocode\" designed to be readable by anyone who has done a little programming. The book contains over 230 figures illustrating how the algorithms work. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms.  \nThe text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.  \nIn this, the second edition, we have updated the entire book. The changes range from the addition of new chapters to the rewriting of individual sentences.  \nTo the teacher  \nThis book is designed to be both versatile and complete. You will find it useful for a variety of courses, from an undergraduate course in data structures up through a graduate course in algorithms. Because we have provided considerably more material than can fit in a typical one-term course, you should think of the book as a \"buffet\" or \"smorgasbord\" from which you can pick and choose the material that best supports the course you wish to teach.  \nYou should find it easy to organize your course around just the chapters you need. We have made chapters relatively self-contained, so that you need not worry about an unexpected and unnecessary dependence of one chapter on another. Each chapter presents the easier material first and the more difficult material later, with section boundaries marking natural stopping points. In an undergraduate course, you might use only the earlier sections from a chapter; ina graduate course, you might cover the entire chapter.  \nWe have included over 920 exercises and over 140 problems. Each section ends with exercises, and each chapter ends with problems. The exe","cbCaid6ThGulQGEg","https://ap.wps.com/l/cbCaid6ThGulQGEg","pdf",11927397,984,"English","# Preface\n## To the teacher\n## To the student\n## Prerequisites for reading this book","[{\"question\":\"What is the purpose of this book as described in the preface?\",\"answer\":\"It provides a comprehensive introduction to the modern study of computer algorithms, presenting algorithms with accessible design and analysis across different levels of readers.\"},{\"question\":\"How are chapters and sections intended to support teaching and learning?\",\"answer\":\"Chapters are designed to be relatively self-contained, with section boundaries marking natural stopping points, allowing instructors to choose what to cover in a course.\"},{\"question\":\"What prerequisites does the preface say are needed to read the book?\",\"answer\":\"The preface indicates readers should have programming experience (including recursive procedures and basic data structures) and some facility with proofs by mathematical induction, with a few portions relying on elementary calculus knowledge.\"}]","Introduction to Algorithms - 2nd ed - Preface | PDF",1789975102,2480]