Development Cycles
  Home arrow Development Cycles arrow Page 4 - The Backtracking Algorithm Technique
Dev Articles Forums 
ADO.NET  
Apache  
ASP  
ASP.NET  
C#  
C++  
ColdFusion  
COM/COM+  
Delphi-Kylix  
Design Usability  
Development Cycles  
DHTML  
Embedded Tools  
Flash  
Graphic Design  
HTML  
IIS  
Interviews  
Java  
JavaScript  
MySQL  
Oracle  
Photoshop  
PHP  
Reviews  
Ruby-on-Rails  
SQL  
SQL Server  
Style Sheets  
VB.Net  
Visual Basic  
Web Authoring  
Web Services  
Web Standards  
XML  
Mobile Linux 
App Generation ROI 
IBM® developerWorks 
Weekly Newsletter
 
Developer Updates  
Free Website Content 
 RSS  Articles
 RSS  Forums
 RSS  All Feeds
Write For Us Get Paid 
Request Media Kit
Contact Us 
Site Map 
Privacy Policy 
Support 
 USERNAME
 
 PASSWORD
 
 
  >>> SIGN UP!  
  Lost Password? 
DEVELOPMENT CYCLES

The Backtracking Algorithm Technique
By: Barzan "Tony" Antal
  • Search For More Articles!
  • Disclaimer
  • Author Terms
  • Rating: 5 stars5 stars5 stars5 stars5 stars / 10
    2008-09-16

    Table of Contents:
  • The Backtracking Algorithm Technique
  • The Theory
  • Problem and Solution
  • Taking a Break

  • Rate this Article: Poor Best 
      ADD THIS ARTICLE TO:
      Del.ici.ous Digg
      Blink Simpy
      Google Spurl
      Y! MyWeb Furl
    Email Me Similar Content When Posted
    Add Developer Shed Article Feed To Your Site
    Email Article To Friend
    Print Version Of Article
    PDF Version Of Article
     
     
    ADVERTISEMENT


    The Backtracking Algorithm Technique - Taking a Break


    (Page 4 of 4 )

    We've come to the end of the first segment of the series. Throughout this article we have covered and focused only on the technique called backtracking. By now we should know what it's all about, when it is the optimal technique to use, and not the least, we also learned how to implement and write code that solves a backtracking problem.

    Summing these up, backtracking ought to be used when no other algorithm or method is possible. By this I mean, it should be used in those cases when the problem can be reduced to some variation of the Descartes multiplication of some kind of arrays. Backtracking, due to its nature, isn't the most efficient technique; its run time can be quite high, and its complexity is just as bad. If any other alternative that gives a quicker result is possible, then it should be avoided. But when all of the results must be generated regardless, it does the job.

    Don't forget to stick around for the upcoming parts of this series. In the next part we will present an interesting technique that gets its name from Latin: divide et impera. It basically means divide and conquer. It is a really useful algorithm that solves many of the typical problems in a really elegant and simplistic fashion. You see, this is another reason why these five algorithms are popular-elegance and efficiency.

    If you have any further questions or require some clarifications then please don't hesitate to join our friendly ever-growing community of professionals, enthusiasts, and experts at DevHardware Forums. We specialize in everything related to hardware, software, and consumer electronics. You might also want to pop into the forums of our sister site called DevShed Forums.

    As always, remember: write clear code, practice, and succeed!


    DISCLAIMER: The content provided in this article is not warranted or guaranteed by Developer Shed, Inc. The content provided is intended for entertainment and/or educational purposes in order to introduce to the reader key ideas, concepts, and/or product reviews. As such it is incumbent upon the reader to employ real-world tactics for security and implementation of best practices. We are not liable for any negative consequences that may result from implementing any information covered in our articles or tutorials. If this is a hardware review, it is not recommended to open and/or modify your hardware.

       · I sort of thought this would be interesting to read as a fledglingprogrammer with...
       · could u plz tell me the backtracking algorithm for 2-tape problem with bounding...
       · Even though your algorithm works, it's bad. It is a severely reduced version of the...
     

    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







    © 2003-2009 by Developer Shed. All rights reserved. DS Cluster 5 Hosted by Hostway
    For more Enterprise Application Development news, visit eWeek