https://bugzilla.novell.com/show_bug.cgi?id=328036#c10
--- Comment #10 from Michi Henning <[EMAIL PROTECTED]> 2007-09-25 18:39:40 MST --- Blush... I hadn't thought of that. Contains() will be O(1), at least for hashtables, and will O(log n) for trees. Doing what you suggest will avoid the call to Sort() and the O(n^2), you are right. Thanks for spotting that! I'll mend the error of my ways and change my implementation ;-) Cheers, Michi. -- Configure bugmail: https://bugzilla.novell.com/userprefs.cgi?tab=email ------- You are receiving this mail because: ------- You are the QA contact for the bug. You are the assignee for the bug. _______________________________________________ mono-bugs maillist - [email protected] http://lists.ximian.com/mailman/listinfo/mono-bugs
