Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I don't know that it's just cyclomatic complexity. I think it at least part of it is proving that you meet hard real-time constraints. Recursion is harder to analyze that way than "for (i = 0; i < 16; i++) ... " is.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: