[bug #17560] merge code in rcs.c is O(n^2)

[Derek Robert Price]

Follow-up Comment #14, bug #17560 (project cvs):

Excuse me - I misstated that.  The improved algorithm was O(n^2) dependent on
the number of RCS change chunks in each revision but only linearly dependent
on the number of revisions.  The rest of what I said should still stand.

Cheers,

    _______________________________________________________

Reply to this item at:

  <http://savannah.nongnu.org/bugs/?17560>

_______________________________________________
  Message sent via/by Savannah
  http://savannah.nongnu.org/