One of the steps in thinking algorithmically is defining the .

A divide and conquer algorithm is an algorithm that breaks a problem into smaller sub-problems that are then solved.

In algorithmic thinking, determining the order in which instructions should be executed is called .

A disadvantage of algorithmic thinking is that it may oversimplify problems.

An algorithm is a sequence of that can be followed to solve a specific problem.