Closed GoogleCodeExporter closed 9 years ago
I've done merge sort implementation but it lacks performance when the data is
large
(more than 9000 elements running on my core2duo)
When number of elements is small it is two times faster than qsort and when the
data
is large it is slower by factor two.
I think the reason is qsort is more cache-friendly than merge sort.
Anyway the code is attached, feel free to play with it.
Original comment by ruslan.savchenko
on 13 Mar 2010 at 6:24
Attachments:
Original issue reported on code.google.com by
ruslan.savchenko
on 12 Jan 2010 at 8:01