Fast Sorting Algorithm

[Owen Arnold]

Sorting too slow for EventWorkspaces. std::sort used in EventWorkspace.cpp i.e. std::sort(events.begin(), events.end(), compareEventTof);

Implement faster Counting Sort generic algorithm as a replacement for Quick Sort std::sort. The following implmentation has been prototyped:

​http://en.wikibooks.org/wiki/Algorithm_implementation/Sorting/Counting_sort

The counting sort algorithm may also be parallelised using OpenMP.

[Peter Peterson]

Another way to do this is to use a ​merge sort algorithm which can do the sorting in place rather than creating a copy.

[Janik Zikovsky]

(In [7923]) Refs #1740: Parallelized sorting of a single event list - first check in. More than 2x faster than the basic algorithm.

[Janik Zikovsky]

(In [7925]) Refs #1740: Fine-tuning of parallelized sortAll() method.

[Peter Peterson]

This works as advertised.

[Stuart Campbell]

This ticket has been transferred to github issue ​2587