News for hackers. Stuff that matters.

A comment on Ask HN: Is Accidental Complexity Growing Faster Than Essential Complexity?. Parent comment

Re:Ask HN: Is Accidental Complexity Growing Faster Than Esse... by _Codemonkeyism on Monday March 27, 2017 @04:02PM (#13971192)
Most efficient is f2(x)=2 or f1(x)=1 I think, not sure yet :-)
[ Parent | on HN ]
Re:Ask HN: Is Accidental Complexity Growing Faster Than Esse... by passiveincomelg on Tuesday March 28, 2017 @07:45AM (#13975757)
I'd say 2 because code reviews are one of the rare "methodologies" that improve quality in my experience.
[ Parent | on HN ]