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

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

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

One advantage of algorithmic thinking is that it can help improve -solving skills.

An algorithm is a set of which, when followed, solves a particular problem.

One of the steps in thinking algorithmically is defining the .