FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Algorithms

Algorithms

Robert Sedgewick, Kevin Wayne
    Product form
      FORMAT: Hardback

      R 1,785.00 Price and availability exclusive to website

      YOU COULD EARN 1,785 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx 5 - 9 Business Days
      BUY NOW PAY LATER
      From R 297.50 per month!
      3x monthly payments of R 595.00 with
      4x fortnightly payments of R 446.25 with
      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.
      Format: CONTRIBUTORS: Robert Sedgewick, Kevin Wayne EAN: 9780321573513 COUNTRY: United States PAGES: WEIGHT: 1620 g HEIGHT: 234 cm
      PUBLISHED BY: Pearson Education (US) DATE PUBLISHED: 2011-03-24 CITY: GENRE: COMPUTERS / Software Development & Engineering / Systems Analysis & Design, COMPUTERS / Programming / Algorithms WIDTH: 188 cm SPINE:

      Book Themes:

      Algorithms and data structures, Systems analysis and design

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick’s research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).   Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).
      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.
      Format: CONTRIBUTORS: Robert Sedgewick, Kevin Wayne EAN: 9780321573513 COUNTRY: United States PAGES: WEIGHT: 1620 g HEIGHT: 234 cm
      PUBLISHED BY: Pearson Education (US) DATE PUBLISHED: 2011-03-24 CITY: GENRE: COMPUTERS / Software Development & Engineering / Systems Analysis & Design, COMPUTERS / Programming / Algorithms WIDTH: 188 cm SPINE:

      Book Themes:

      Algorithms and data structures, Systems analysis and design

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Robert Sedgewick has been a Professor of Computer Science at Princeton University since 1985, where he was the founding Chairman of the Department of Computer Science. He has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA, and is member of the board of directors of Adobe Systems. Professor Sedgewick’s research interests include analytic combinatorics, design and analysis of data structures and algorithms, and program visualization. His landmark book, Algorithms, now in its fourth edition, has appeared in numerous versions and languages over the past thirty years. In addition, with Kevin Wayne, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).   Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization. With Robert Sedgewick, he is the coauthor of the highly acclaimed textbook, Introduction to Programming in Java: An Interdisciplinary Approach (Addison-Wesley, 2008).

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account