Isbn: 9780321573513 - algorithms (15 Ergebnisse)

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. Very Good text overall, cover has some light shelf rubbing and a few light scratches. US orders shipped via US Mail. International orders shipped via DHL. Additional postage may be required on oversize books and sets. NO prison orders.

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. 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.

Zustand: New. In English.

Zustand: New.

Zustand: Nuevo. Algorithms 4th Edition editado por Addison wesley.

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

Zustand: NEW.

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.

Zustand: New. This fourth 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 pr.

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.…

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.