C# parallel cores process a method across all cores.

// Bubble Sort
            int i;
            int j;
            int temp;
            int[] a = bArray;
            int x = a.Count();
            for (i = (x - 1); i >= 0; i--)
                for (j = 1; j <= i; j++)
                    if (a[j - 1] > a[j])
                        temp = a[j - 1];
                        a[j - 1] = a[j];
                        a[j] = temp;

Open in new window

Trying to find a way to make the above code run overall available cores. Any ideas?
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Dennis AriesCEO @ Arkro ITCommented:
You can't. Algorithms like these are designed for single-processing. If you want to sort an array using multuple threads/processes, you would need something like a merge-sort in which you split your array and merge the individual results.

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
.NET Programming

From novice to tech pro — start learning today.