[Mono-bugs] [Bug 506070] New: List<int>.Sort () is slower than Array.Sort <int>

[bugzilla_noreply at novell.com]

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: mono-bugs at lists.ximian.com
        ReportedBy: amcgovern at novell.com
         QAContact: mono-bugs at lists.ximian.com
          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.