with our free apps for iPhone, iPad and Android

Get StartedAlready have an account? Log In

Algorithms, Data Structures, Computer Science, Math Created by svndao
by Seven D
#
Algorithms, Data Structures, Computer Science, Math Created by svndao

##
Flow of Control

###
Iterative

###
Recursion

##
Math

###
Math Theory

###
Numbers

###
Discrete Math

###
Modulo Tricks

##
General Knowledge

###
ADEPT Method

###
Fermi Problems

##
CS Concepts

###
Big O & Time Complexity

###
Bit Manipulation

###
Dynamic Programming

###
Greedy Algorithm

###
Backtracking

###
System Design Concepts

###
P vs NP Problem

###
Deterministic vs Non-Deterministic

##
Algorithm Theory

###
Classifying Algorithms

##
Data Structures

###
Choosing the Right Data Structure

###
API Methods to Know

##
Algorithms

###
General

###
Sorting

###
Searching

##
Java

###
Concepts

###
Java Collections

###
Data Structure Comparisons

5.0 stars - 11 reviews
range from 0 to 5

Recursion is the key in backtracking programming. As the name suggests we backtrack to find the solution. We start with one possible move out of many available moves and try to solve the problem if we are able to solve the problem with the selected move then we will print the solution else we will backtrack and select some other move and try to solve it. If none if the moves work out we will claim that there is no solution for the problem.

The P versus NP problem is the determination of whether all NP-problems are actually P-problems. If P and NP are not equivalent, then the solution of NP-problems requires (in the worst case) an exhaustive search, while if they are, then asymptotically faster algorithms may exist. The answer is not currently known, but determination of the status of this question would have dramatic consequences for the potential speed with which many difficult and important problems could be solved.