https://bugs.wireshark.org/bugzilla/show_bug.cgi?id=7149
--- Comment #14 from Evan Huus <eapache@xxxxxxxxx> 2012-04-19 12:58:49 PDT ---
(In reply to comment #12)
> (In reply to comment #10)
> > It's really O(n log n) you forgot about hash tree :-)
>
> Mhm, I really should take my algorithm classes again...
I just wrote the exam for mine last week :)
I have a patch which I believe is correct, but I've not been able to verify
that it actually causes a speedup, since none of my samples are large enough.
Also of note: "Flow Graph" is *doubly* slow because it's using the O(n)
g_list_append() for each packet in ui/gtk/flow_graph.c:307 leading to an O(n^2)
running time even with this (potential) fix applied.
--
Configure bugmail: https://bugs.wireshark.org/bugzilla/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are watching all bug changes.