Processing ......
FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World
 
Algorithms: Fundamental Techniques
网址居 (LinkBasket) - 海外中英文新闻网站导航!.
  • Title: Algorithms: Fundamental Techniques
  • Author(s) Macneil Shonle, Matthew Wilson, Martin Krischik
  • Publisher: WikiBooks; eBook (Creative Commons Licensed)
  • License(s): CC BY-SA 3.0
  • Paperback: N/A
  • eBook: HTML and PDF
  • Language: English
  • ISBN-10: 1466346310
  • ISBN-13: 978-1466346314
  • Share This:  

Book Description

This book is about the creation and analysis of efficient algorithms. After introducing some necessary matical background this book covers:

  • 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 algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth. This book is written so it can be read from "cover to cover" in the length of a semester, where sections marked with a * may be skipped.

This book is a tutorial on techniques and is not a reference. For references we highly recommend the tomes by [Knuth] and [CLRS]. Additionally, sometimes the best insights come from the primary sources themselves.

About the Authors
  • N/A
Reviews, Ratings, and Recommendations: Related Book Categories: Read and Download Links: Similar Books:
  • Lecture Notes for the Algorithms (Jeff Erickson)

    This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

  • Algorithm Design (Jon Kleinberg, et al)

    This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

  • Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne

    It surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the book. We motivate each algorithm that we address by examining its impact on specific applications.

  • Elementary Algorithms (Xinyu Liu)

    This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

  • Algorithms and Data Structures (Niklaus Wirth)

    From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). It includes new material on sequential structure, searching and priority search trees.

  • The Algorithm Design Manual (Steven S. Skiena)

    This book serves as the primary textbook for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms, intended as a manual on algorithm design for both students and computer professionals.

  • Introduction to Design Analysis of Algorithms (K. Raghava Rao)

    This book was very useful to easily understand the algorithms. This book is having enough examples on every algorithm. It has written for the sake of students to provide complete knowledge on Algorithms.

Book Categories
:
Other Categories
Resources and Links