TAILIEUCHUNG - ALGORITHMSROBERT SEDGEWIK

A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing, including fifty algorithms every programmer should know. See | ALGORITHMS ROBERT SEDGEWICK BROWN UNIVERSITY ADDISON-WESLEY PUBLISHING COMpANy Reading Massachusetts Menlo Park California London Amsterdam Don Mills Ontario Sydney To Adam Brett Robbie and especially Linda This book is in the Addison-Wesley Series in Computer Science Consulting Editor Michael A. Harrison Sponsoring Editor James T. DeWolfe Library of Congress Cataloging in Publication Data Sedgewick Robert 1946- Algorithms. 1. Algorithms. I. Title. 1983 ISBN O-201 -06672-6 82-11672 Reproduced by Addison-Wesley from camera-ready copy supplied by the author. Reprinted with corrections August 1984 Copyright 1983 by Addison-Wesley Publishing Company Inc. All rights reserved. No part of this publication may be reproduced stored in a retrieval system or transmitted in any form or by any means electronic mechanical photocopying recording or otherwise without prior written permission of the publisher. Printed in the United States of America. ISBN o-201-06672-6 FGHIJ-HA-8987654 Preface This book is intended to survey the most important algorithms in use on computers today and to teach fundamental techniques to the growing number of people who are interested in becoming serious computer users. It is appropriate for use as a textbook for a second third or fourth course in computer science after students have acquired some programming skills and familiarity with computer systems but before they have specialized courses in advanced areas of computer science or computer applications. Additionally the book may be useful as a reference for those who already have some familiarity with the material since it contains a number of computer implementations of useful algorithms. The book consists of forty chapters which are grouped into seven major parts mathematical algorithms sorting searching string processing geometric algorithms graph algorithms and advanced topics. A major goal in the development of this book has been to bring together the fundamental methods from

• Kỹ thuật lập trình
• Data structures Fundamentals
• programming using C
• complexity analysis
• linked lists
• function calls
• binary trees
• Algorithms in Java
• data structures
• algorithms
• data structure lectures
• structured document data
• teaching data structures
• algorithms in data structures
• Fundamentals of OOP
• principles of OOP
• Java Richard Wiene
• oriented programming
• Fundamentals of computer programming with C#
• Computer programming
• Defining classes
• Text files
• Linear data structures
• Lambda expressions and LINQ
• Data structures and algorithms
• Computer science
• Design of data structures
• Java primer 1
• The java compiler
• Analysis of algorithms
• Analyzing recursive algorithms
• AVL trees
• Binary search trees
• Red black trees
• Dynamic programming
• Shortest path
• Sorting lower bound
• Memory management
• IO methods
• Control flow
• Object oriented programming
• Using arrays
• Doubly linked lists
• Singly linked lists
• Arrays
• rrayLists
• Basic Sorting Algorithms
• Advanced Algorithms
• Graph Algorithms
• HashTable Class
• Recursive algorithms
• Nonnumerical recursive algorithms
• Object oriented programming with Java
• Programming language
• Java programming language
• Bài giảng ngôn ngữ lập trình Java
• Recursion and advanced algorithms
• The selection sort
• The sorting objects