The affine projection (AP) algorithm is one of the most celebrated adaptive filtering algorithms, and it achieves a good tradeoff between the convergence rate and computational complexity. However, the complexity of the AP algorithm increases with the projection order. A wealth of fast AP algorithms have been proposed to reduce the complexity in the last two decades. However, those low-complexity methods have not been well analyzed and compared. To fill this gap, this paper reviews the fast AP algorithms, including both fast filtering approaches and efficient solutions of the linear system of equations. The advantages and disadvantages of each fast implementation version are clarified based on an extensive performance evaluation, which could be useful to engineers when selecting a suitable algorithm for their specific applications and could also be a starting point for experts in this field to develop better solutions.