Home arrow Development Cycles arrow The Backtracking Algorithm Technique
DEVELOPMENT CYCLES

The Backtracking Algorithm Technique


Every so often during our software development endeavors we might face situations where the solution(s) can be found easily or the job can be done quickly using typical well-known algorithms that can be implemented routinely. This is the first part of a multi-segment series on programming techniques where we briefly present algorithm methods one by one. This time we are going to cover backtracking.

Author Info:
By: Barzan "Tony" Antal
Rating: 4 stars4 stars4 stars4 stars4 stars / 31
September 16, 2008
TABLE OF CONTENTS:
  1. · The Backtracking Algorithm Technique
  2. · The Theory
  3. · Problem and Solution
  4. · Taking a Break

print this article
SEARCH DEVARTICLES

The Backtracking Algorithm Technique
(Page 1 of 4 )

Before we begin, let me present the structure of this series and how each article will be constructed. To preserve clarity and straightforwardness each article will be limited to the presentation of only one algorithm technique. Gradually, we are going to learn each of the fab fives: backtracking, divide and conquer (divide et impera), greedy method, dynamic programming, and branch and bound.

Each article will start by explaining concisely what the algorithm is all about, which are the situations where their application is recommended, and typical places where their usage is efficient and, thus, worthwhile. Then we will present real world applicable examples, first in pseudo-code and then in ANSI C. The problems will be famous for those algorithms under which we'll solve them.

Ultimately, we may some time in the future refer back to the algorithm methods we learned during the earlier parts of the series (no worries, it won't happen with this first part) explaining why this or that may not be considered as a possible solution.

Keep in mind that these articles will give a brief overview of the techniques and their usage, as well as their implementation, but they cannot replace a complete and comprehensive few-days-long course or a text book specializing just on one of the algorithms. Clear presentations with applicable implementations along with succinct resumes are the most we can do. But this series can surely get you started.

All of this being said, I bet you are anxious to begin. Let's backtrack!


blog comments powered by Disqus
DEVELOPMENT CYCLES ARTICLES

- Division of Large Numbers
- Branch and Bound Algorithm Technique
- Dynamic Programming Algorithm Technique
- Genetic Algorithm Techniques
- Greedy Strategy as an Algorithm Technique
- Divide and Conquer Algorithm Technique
- The Backtracking Algorithm Technique
- More Pattern Matching Algorithms: B-M
- Pattern Matching Algorithms Demystified: KMP
- Coding Standards
- A Peek into the Future: Transactional Memory
- Learning About the Graph Construct using Gam...
- Learning About the Graph Construct using Gam...
- Learning About the Graph Construct using Gam...
- How to Strike a Match

Watch our Tech Videos 
Dev Articles Forums 
 RSS  Articles
 RSS  Forums
 RSS  All Feeds
Write For Us 
Weekly Newsletter
 
Developer Updates  
Free Website Content 
Contact Us 
Site Map 
Privacy Policy 
Support 

Developer Shed Affiliates

 




© 2003-2017 by Developer Shed. All rights reserved. DS Cluster - Follow our Sitemap
Popular Web Development Topics
All Web Development Tutorials