Hacker News new | past | comments | ask | show | jobs | submit login

I'm inclined to agree that it is hard to create an algorithm using tdd (for example Dijkstra's algorithm). But "the example" mentioned in the post is not grounded. It would be nice if someone had a real-world example to back up this claim or else it is very easy to bring up the argument that the author is not applying tdd correcly



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

Search: