An iterative algorithm is an algorithm that repeats a sequence of until a certain condition is met.

are a finite sequence of steps designed to solve a problem.

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

A sorting algorithm is an algorithm that puts elements of a list or an array in a certain .

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

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