# Computational complexity of the lasso (lars vs coordinate descent)

The lasso can be computed with the LARS or Coordinate Descent algorithm.

What is their computational complexity and when one is quicker than the other?

It's shown that coordinate descent is faster in each setting: $$p>N, p and sparse or dense data. There are some examples featuring both simulated and real data.