272 reputation
212
bio website
location
age
visits member for 4 years
seen Oct 12 at 14:39

May
2
awarded  Informed
Feb
5
accepted On which abstraction level would you do TDD?
Jan
31
comment On which abstraction level would you do TDD?
I understand your point with integration testing. Am also familiar with mocks and stubs. But still: I change the structure of A and all of a sudden end up having to change B1 (including its interface and mock respectively) and throw away C2. I'm probably lacking experience in design and SOLID principles. Very good point in your "worth noting" addition.
Jan
31
asked On which abstraction level would you do TDD?
Dec
13
awarded  Notable Question
Aug
5
awarded  Excavator
Aug
5
revised I've inherited 200K lines of spaghetti code — what now?
deleted 1 characters in body
Jun
20
accepted What's the computational complexity of the Groovy unique() method?
Jun
20
comment What's the computational complexity of the Groovy unique() method?
@KChaloux: You may have the honors.
Jun
20
comment What's the computational complexity of the Groovy unique() method?
@KChaloux: Ok, from your comments I understand that the best implementation of unique() would have a complexity of O(n), but this particular Groovy implementation of unique() in revision 728bb83ec has a complexity of O(n^2). Thank you.
Jun
20
comment What's the computational complexity of the Groovy unique() method?
@jk.: Two nested for-loops iterating over n, so O(n^2)?
Jun
20
asked What's the computational complexity of the Groovy unique() method?
May
7
awarded  Popular Question
Apr
13
accepted What methods are there to avoid a stack overflow in a recursive algorithm?
Apr
11
awarded  Nice Question
Apr
11
comment What methods are there to avoid a stack overflow in a recursive algorithm?
No, not at all. It's perfect. Thanks a bunch for asking!
Apr
11
awarded  Yearling
Apr
11
comment What methods are there to avoid a stack overflow in a recursive algorithm?
I had come across that xkcd cartoon today while surfing the web. :-) Randall Munroe's cartoons are a delight.
Apr
11
awarded  Commentator
Apr
11
comment What methods are there to avoid a stack overflow in a recursive algorithm?
Very understandable explanation of memoization. Above all, thank you for illustrating it with a code snippet. Also, "there's going to be a lot of repetition at the end of the sequences" made things clear for me. Thank you.