Store besparelser
Hurtig levering
Gemte
Log ind
0
Kurv
Kurv

Algorithms

Af: Robert Sedgewick, Kevin Wayne Engelsk Hardback

Algorithms

Af: Robert Sedgewick, Kevin Wayne Engelsk Hardback
Tjek vores konkurrenters priser

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

Strings

  • String sorts
  • Tries
  • Substring search
  • Regular expressions
  • Data 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.

Tjek vores konkurrenters priser
Normalpris
kr 683
Fragt: 39 kr
6 - 8 hverdage
20 kr
Pakkegebyr
God 4 anmeldelser på
Tjek vores konkurrenters priser

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

Strings

  • String sorts
  • Tries
  • Substring search
  • Regular expressions
  • Data 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.

Produktdetaljer
Sprog: Engelsk
Sider: 976
ISBN-13: 9780321573513
Indbinding: Hardback
Udgave: 4
ISBN-10: 032157351X
Udg. Dato: 31 mar 2011
Længde: 37mm
Bredde: 239mm
Højde: 198mm
Forlag: Pearson Education (US)
Oplagsdato: 31 mar 2011
Forfatter(e): Robert Sedgewick, Kevin Wayne
Forfatter(e) Robert Sedgewick, Kevin Wayne


Kategori Algoritmer og datastrukturer


ISBN-13 9780321573513


Sprog Engelsk


Indbinding Hardback


Sider 976


Udgave 4


Længde 37mm


Bredde 239mm


Højde 198mm


Udg. Dato 31 mar 2011


Oplagsdato 31 mar 2011


Forlag Pearson Education (US)

Kategori sammenhænge