> My understanding of an algorithm is that it must terminate in a finite amount of time Any practical algorithm yes. Any theoretical algorithm no. This is wher

> My understanding of an algorithm is that it must terminate in a finite amount of time Any practical algorithm yes. Any theoretical algorithm no. This is where the will it hault questions come from. Check out Ackerman's function as a good example that we aren't sure if it will terminate. It is still extremely interesting from an algorithms analysis perspective but not from a CS (as I use it) perspective. Also I'm not specifically talking about algorithms. I'm talking about flaws in O() notation in practice. It is easy to make something look fast in theory when it is far slower in practice.