http://bugzilla.novell.com/show_bug.cgi?id=506070
Summary: List<int>.Sort () is slower than Array.Sort <int>
Classification: Mono
Product: Mono: Class Libraries
Version: SVN
Platform: Other
OS/Version: Other
Status: NEW
Severity: Normal
Priority: P5 - None
Component: CORLIB
AssignedTo: [email protected]
ReportedBy: [email protected]
QAContact: [email protected]
Found By: ---
If Array.Sort<int> is called directly we end up calling combsort (int) on the
array.
If we use List<int>.Sort () we instantiate a generic comparer and use that for
comparing rather than using the (much faster) combsort (int) method.
--
Configure bugmail: http://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
