On Sun, Jul 11, 2021 at 10:47 PM Michael Kay mike(_at_)saxonica(_dot_)com <
xsl-list-service(_at_)lists(_dot_)mulberrytech(_dot_)com> wrote:
Yes, but doing N-squared deep-equal comparisons doesn't scale very well.
I thought that, the problem was not a grouping problem. And I wanted to
present an algorithm, that captures the problem statement.
I also think that, my algorithm's worst case complexity is probably O(N*N),
but its average case complexity is perhaps much better than O(N*N).
--
Regards,
Mukul Gandhi
--~----------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
EasyUnsubscribe: http://lists.mulberrytech.com/unsub/xsl-list/1167547
or by email: xsl-list-unsub(_at_)lists(_dot_)mulberrytech(_dot_)com
--~--