The algorithm tries to extend a partial solution toward completion
a.
backtracking
b.
recursive
c.
backordering

Backtracking

Explanation:

Backtracking algorithm approaches a solution in a recursive fashion whereby it tries to build answers and modify them in time intervals as we progress through the solution. One such backtracking algorithm is the N Queen problem whereby we place N Queen in a chessboard of size NxN such that no two queens attack each other. So we place a queen and backtrack if there is a possibility that the queen is under attack from other queen. This process continues with time and thereby it tends to extend a partial solution towards the completion.

this seems to be in the wrong category. but i'll take some free points my dude

posting this in wrong category will result in people seeing it who won't know the answer.