SØG - mellem flere end 8 millioner bøger:
Viser: Algorithms
Algorithms
Robert Sedgewick og Kevin Wayne
(2011)
Sprog: Engelsk
Addison Wesley Professional
877,00 kr.
ikke på lager, Bestil nu og få den leveret
om ca. 15 hverdage
om ca. 15 hverdage
Algorithms Vital Source e-bog
Robert Sedgewick og Kevin Wayne
(2011)
Pearson International
298,00 kr.
Leveres umiddelbart efter køb
Algorithms Vital Source e-bog
Robert Sedgewick og Kevin Wayne
(2011)
Pearson International
362,00 kr.
Leveres umiddelbart efter køb
Algorithms Vital Source e-bog
Robert Sedgewick og Kevin Wayne
(2011)
Pearson International
426,00 kr.
Leveres umiddelbart efter køb
Søgbar e-bog
Algorithms Vital Source e-bog
Robert Sedgewick og Kevin Wayne
(2011)
Pearson International
852,00 kr.
Leveres umiddelbart efter køb
Detaljer om varen
- 4. Udgave
- Hardback: 976 sider
- Udgiver: Addison Wesley Professional (Marts 2011)
- Forfattere: Robert Sedgewick og Kevin Wayne
- ISBN: 9780321573513
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.
Chapter 1: Fundamentals
1.1 Programming Model
1.2 Data Abstraction
1.3 Queues, Stacks, and Bags
1.4 Analysis of Algorithms
1.5 Case Study: Union-Find
Chapter 2: Sorting
2.1 Elementary Sorts
2.1 Elementary Sorts
2.2 Mergesort
2.3 Quicksort
2.4 Priority Queues
2.5 Applications
Chapter 3: Searching
3.1 Symbol Tables
3.1 Symbol Tables
3.2 Binary Search Trees
3.3 Balanced Search Trees
3.4 Hash Tables
3.5 Applications
Chapter 4: Graphs
4.1 Undirected graphs
4.1 Undirected graphs
4.2 Directed graphs
4.3 Minimum Spanning Trees
4.4 Shortest Paths
Chapter 5: Strings
5.1 String Sorts
5.1 String Sorts
5.2 Tries
5.3 Substring Search 5.4 Regular Expressions
5.5 Data Compression Context Systems Programming Systems Programming Scientific Computing Commercial Applications Operations Research Intractability Index
Detaljer om varen
- 4. Udgave
- Vital Source 90 day rentals (dynamic pages): 992 sider
- Udgiver: Pearson International (Februar 2011)
- Forfattere: Robert Sedgewick og Kevin Wayne
- ISBN: 9780132762564R90
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.
Licens varighed:
Bookshelf online: 90 dage fra købsdato.
Bookshelf appen: 90 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 90 dage fra købsdato.
Bookshelf appen: 90 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 4. Udgave
- Vital Source 180 day rentals (dynamic pages): 992 sider
- Udgiver: Pearson International (Februar 2011)
- Forfattere: Robert Sedgewick og Kevin Wayne
- ISBN: 9780132762564R180
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.
Licens varighed:
Bookshelf online: 180 dage fra købsdato.
Bookshelf appen: 180 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 180 dage fra købsdato.
Bookshelf appen: 180 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 4. Udgave
- Vital Source 365 day rentals (dynamic pages): 992 sider
- Udgiver: Pearson International (Februar 2011)
- Forfattere: Robert Sedgewick og Kevin Wayne
- ISBN: 9780132762564R365
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.
Licens varighed:
Bookshelf online: 365 dage fra købsdato.
Bookshelf appen: 365 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 365 dage fra købsdato.
Bookshelf appen: 365 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 4. Udgave
- Vital Source searchable e-book (Reflowable pages): 992 sider
- Udgiver: Pearson International (Februar 2011)
- Forfattere: Robert Sedgewick og Kevin Wayne
- ISBN: 9780132762564
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.
Licens varighed:
Bookshelf online: 5 år fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 5 år fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
De oplyste priser er inkl. moms
Butikker og åbningstid
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Find pensumliste
FAQ for studerende
Pensumlistegaranti
Sortiment og levering
Kompendier(for undervisere)
FAQ for studerende
Pensumlistegaranti
Sortiment og levering
Kompendier(for undervisere)
Polyteknisk Boghandel og Forlag A/S - Anker Engelundsvej 1 - 2800 Lyngby
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927