logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Algorithms 4 11th Printing Robert Sedgewick Kevin Wayne

  • SKU: BELL-48124128
Algorithms 4 11th Printing Robert Sedgewick Kevin Wayne
$ 31.00 $ 45.00 (-31%)

4.1

70 reviews

Algorithms 4 11th Printing Robert Sedgewick Kevin Wayne instant download after payment.

Publisher: Addison-Wesley Professional
File Extension: PDF
File size: 12.92 MB
Pages: 955
Author: Robert Sedgewick, Kevin Wayne
ISBN: 9780321573513, 032157351X
Language: English
Year: 2017
Edition: 4 (11th Printing)

Product desciption

Algorithms 4 11th Printing Robert Sedgewick Kevin Wayne by Robert Sedgewick, Kevin Wayne 9780321573513, 032157351X instant download after payment.

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.

Related Products