Disqus - Latest Comments for Stephan202

Re: Binary search returns … ?

Stephan Schroevers — Wed, 12 May 2010 16:57:08 -0000

Are you sure that first link to Programming Pearls is as you intended it? That Flickr page appears completely unrelated (to me, anyway :).

Re: When you comment on a comment

Stephan Schroevers — Fri, 12 Feb 2010 02:49:11 -0000

I do read all comments on this site (even have a separate RSS feed for them). Kudos to you for the fitting description "trolling teenager" :D.

Re: Next permutation — When C++ gets it right

Stephan Schroevers — Fri, 20 Nov 2009 03:24:48 -0000

It says "1 comment" here. And yours is the first comment of which I am notified through RSS...

Re: Steady on Subversion

Stephan Schroevers — Fri, 16 Oct 2009 04:59:33 -0000

Could the increased need for offline commits perhaps be explained by the (relatively) recent popularity of netbooks? People who would otherwise leave their laptops at home, may find a netbook small enough to carry around everywhere.

Re: Longest common subsequence

Stephan Schroevers — Wed, 05 Aug 2009 15:43:05 -0000

The number of distinct characters is limited. Therefore, as two (arbitrary, random) input strings grow larger, the number of characters unique to either of the inputs approaches zero. The algorithm presented here works for arbitrary inputs (arbitrary in terms of length and number of distinct characters).

Of course, if one knows that inputs will have certain regularities (such a large number of characters unique to either input), then one *may* be able to devise a specialised algorithm which, on that specific class of inputs, outperforms the algorithm described above.

Re: Maximum of an empty sequence?

Stephan Schroevers — Thu, 12 Mar 2009 15:09:57 -0000

This is by convention. And indeed, all elements in zs() are true. There just are none. Also see http://en.wikipedia.org/wik...

Edit: this post is a reply to David Avraamides; I clicked the 'reply' link below his post, but Disqus decided otherwise...