Backtracking is a class of algorithms used to find solutions to computational problems, such as the eight queens puzzle. It builds partial candidates and abandons them if they cannot be completed to a valid solution. It is often much faster than brute-force enumeration and is the basis of logic programming languages. The term was coined by D. H. Lehmer in the 1950s.
University of Washington
Summer 2022
This course is a continuation of CSE 142, focusing on manipulating data, implementing data structures, and learning about algorithms in Java. It delves into abstract data types, recursion, inheritance, and more.
No concepts data
+ 34 more concepts