dragonspit / hpcsharp Goto Github PK

Unhandled exception. System.IO.FileNotFoundException: Could not load file or assembly 'HPCsharp, Version=3.17.1.0,...

I am trying to find the fastest way to sort strings (actually an array of ascii byte*), and have came across https://www.codeproject.com/articles/146086/fast-string-sort-in-c-and-f. It works very well for me. However, it only utilizes a single thread (it uses multikey-quicksort). I tried to use HPCsharps parallel merge sort with the same data, however, on a 24-thread system, it was only slightly faster than the codeproject article mentioned. I was wondering if there was an even faster way to sort an array of byte* pointing to ASCII text, preferably parallel.

Sorry if this is a bad place to put it.
Thanks

Version 3.16.3 seems to require 4.6.1

When I try to run in a 4.6.2 program I get a bad image load errors:

Exception thrown: 'System.BadImageFormatException' in mscorlib.dll
Exception thrown: 'System.AggregateException' in mscorlib.dll
Exception thrown: 'System.BadImageFormatException' in mscorlib.dll
Exception thrown: 'System.BadImageFormatException' in mscorlib.dll
An unhandled exception of type 'System.AggregateException' occurred in mscorlib.dll
One or more errors occurred.

How do I get it to run under 4.6.2?

Hi @DragonSpit
What to you suggest the best algorithm for sorting a 'uchar array' of a million elements and getting sorted indices?
e.g.
uchar data[10] = {2,8,6,25,255,23,96,102,235,0}; // actual one has million values

Output:

{4, 8, 7, 6, 3, 5, 1, 2, 0, 9}

Do you mind if I contribute a pull request with a test project? I think I've spotted a bug in the code, but I realized there's not a great way to prove it since there's no test project...

It would be a .NET Core library using NUnit.

I'm interested in helping out with the project where I can.

Hi, is it possible to use parallel merge sort to return the sorted indexes / keys? Or to sort one int[] array according to the order of another double[] array?

For example, Array.Sort(x1,x2) will sort x2 in the order of x1.

SortMergeInPlacePar is 2x faster than Array.Sort for my n=500k double array so I would really like to use it.