diff --git a/src/builtin_functions.c b/src/builtin_functions.c
index 6a10ecacbe26819e47cb0dd38735902e63944120..316dd9b72c0f116526a3aff67639ca6eb31715dd 100644
--- a/src/builtin_functions.c
+++ b/src/builtin_functions.c
@@ -4,7 +4,7 @@
 ||| See the files COPYING and DISCLAIMER for more information.
 \*/
 #include "global.h"
-RCSID("$Id: builtin_functions.c,v 1.109 1998/05/19 18:46:06 grubba Exp $");
+RCSID("$Id: builtin_functions.c,v 1.110 1998/05/19 18:47:41 grubba Exp $");
 #include "interpret.h"
 #include "svalue.h"
 #include "pike_macros.h"
@@ -2168,6 +2168,9 @@ static struct array *diff_longest_sequence(struct array *cmptbl, int blen)
  *
  * This makes it faster than the G-M algorithm on binary data,
  * but slower on ascii data.
+ *
+ * NOT true! The G-M algorithm seems to be faster on most data anyway.
+ *	/grubba 1998-05-19
  */
 static struct array *diff_dyn_longest_sequence(struct array *cmptbl, int blen)
 {