Material Detail

"Algorithms" icon

Algorithms

This is a free, online wikibook, which means that it is continually updated.  "This book aims to be an accessible introduction into the design and analysis of efficient algorithms. Throughout the book we will introduce only the most basic techniques and describe the rigorous mathematical methods needed to analyze them. The topics covered include The divide and conquer technique. The use of randomization in algorithms. The general, but typically inefficient, backtracking technique. Dynamic programming as an efficient optimization for some backtracking algorithms. Greedy algorithms as an optimization of other kinds of backtracking algorithms. Hill-climbing techniques, including network flow. The goal of the book is to show you how you can methodically apply different techniques to your own... Show More
Rate

Quality

  • Editor Reviews
  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.