Apriori uses a "bottom up" approach, where frequent subsets are extended one item at a time (a step known as candidate generation), and groups of candidates are tested against the data.
The pseudo code for the algorithm is given below for a transaction database T, and a support threshold of \epsilon.