fix comment

darcs-hash:20070906172640-c8de0-11a7a435200e761ead10dc64dd940eeed6bfcdbe.gz

diff --git a/util/sobolseq.c b/util/sobolseq.c
index 194827775a2896302ba78a1a35f0ed42f946bb9d..b72d79274d2c3b7c2c634eae0d6f669f5ef8d254 100644 (file)
--- a/util/sobolseq.c
+++ b/util/sobolseq.c
@@ -75,8 +75,7 @@ typedef struct nlopt_soboldata_s {
      uint32_t n; /* number of x's generated so far */
 } soboldata;
 
-/* Return position (0, 1, ...) of rightmost zero bit in n,
- * via binary search on the (32) bits of n. 
+/* Return position (0, 1, ...) of rightmost zero bit in n.
  *
  * This code uses a 32-bit version of algorithm to find the rightmost
  * one bit in Knuth, _The Art of Computer Programming_, volume 4A