ISBN: 9780321573513 - algorithms (20 Ergebnisse)

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardcover. Zustand: Fair. 4th. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Zustand: acceptable. This copy has clearly been enjoyedâ"expect noticeable shelf wear and some minor creases to the cover. Binding is strong, and all pages are legible. May contain previous library markings or stamps.

Hardcover. Zustand: Fair. 4th. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Hardcover. Zustand: Very Good. 4th. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Zustand: Very Good. 4th. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Zustand: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Soft cover. Zustand: New. Zustand des Schutzumschlags: New. International Edition. **INTERNATIONAL EDITION** Read carefully before purchase: This book is the international edition in mint condition with the different ISBN and book cover design, the major content is printed in full English as same as the original North American edition. The book printed in black and white, generally send in twenty-four hours after the order confirmed. All shipments go through via USPS/UPS/DHL with tracking numbers. Great professional textbook selling experience and expedite shipping service.…

Zustand: New.

Buch. Zustand: Neu. Neuware -The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should knowPrinceton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.Fundamentals: Basic programming modelsData abstractionBags, queues, and stacksAnalysis of algorithmsSortingElementary sortsMergesortQuicksortPriority queuesApplicationsGraphsUndirected graphsDirected graphsMinimum spanning treesShortest pathsStringsString sortsTriesSubstring searchRegular expressionsData compressionThese algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them. 976 pp. Englisch.…

Buch. Zustand: Neu. Neuware -The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should knowPrinceton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.Fundamentals: Basic programming modelsData abstractionBags, queues, and stacksAnalysis of algorithmsSortingElementary sortsMergesortQuicksortPriority queuesApplicationsGraphsUndirected graphsDirected graphsMinimum spanning treesShortest pathsStringsString sortsTriesSubstring searchRegular expressionsData compressionThese algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them. 976 pp. Englisch.…

Zustand: New.

hardcover. Zustand: Gut. 976 Seiten; 9780321573513.3 Gewicht in Gramm: 3.

Hardcover. Zustand: New. Special order direct from the distributor.

Hardcover. Zustand: new. Hardcover. A practical resource for everyone seeking to run programs faster or solve larger problems This edition of Robert Sedgewick and Kevin Wayne's Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book - including 50 algorithms every programmer should know - represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. Essential Information about Algorithms and Data Structures 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 Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

Buch. Zustand: Neu. Algorithms | Robert Sedgewick (u. a.) | Buch | Gebunden | Englisch | 2011 | Addison Wesley | EAN 9780321573513 | Verantwortliche Person für die EU: Addison Wesley, St.-Martin-Str. 82, 81541 München, salesde[at]pearson[dot]com | Anbieter: preigu.

Hardback. Zustand: New. The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.  Fundamentals: Basic programming modelsData abstractionBags, queues, and stacksAnalysis of algorithms  Sorting Elementary sortsMergesortQuicksortPriority queuesApplications  Graphs Undirected graphsDirected graphsMinimum spanning treesShortest paths Strings String sortsTriesSubstring searchRegular expressionsData compression These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them.…

Gebundene Ausgabe. Zustand: Neu. The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should knowPrinceton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment. Fundamentals: - Basic programming models- Data abstraction- Bags, queues, and stacks- Analysis of algorithms Sorting- Elementary sorts- Mergesort- Quicksort- Priority queues- Applications Graphs- Undirected graphs- Directed graphs- Minimum spanning trees- Shortest pathsStrings- String sorts- Tries- Substring search- Regular expressions- Data compressionThese algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them. Sprache: Englisch Gewicht in Gramm: 1630.…

Buch. Zustand: Neu. Neuware -The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should knowPrinceton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment. Fundamentals: - Basic programming models- Data abstraction- Bags, queues, and stacks- Analysis of algorithms Sorting- Elementary sorts- Mergesort- Quicksort- Priority queues- Applications Graphs- Undirected graphs- Directed graphs- Minimum spanning trees- Shortest pathsStrings- String sorts- Tries- Substring search- Regular expressions- Data compressionThese algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them. 976 pp. Englisch.…

Zustand: gut. 2011. Algorithms In englischer Sprache. pages.