With the sole exception of item (3) in that list (pertaining to dynamic allocation), which others carry a cost?
Giving all loops a fixed upper bound comes at a cost to code readability (consider the example of traversing a linked list, as given in the article).