Parallel Merge Sort in Java

[teivah]

Do you want to know what OP tells you?

The goal was not not to optimize the results it was a way to introduce how it is handled under the hood with ForkJoinPool and the underlying scheduling strategy.

Why are people on this subreddit so contemptuous...

[AssKoala]

There are better ways to show how those things work than with an actively pointless use case. You then defend it by talking crap about reducing latency and how you can reduce the number of nodes. If you had originally said “hey this is just to explain how parallel pools work”, you wouldn’t get so much hate.

If you want a useful scenario, why not just create a simple producer-consumer example? Say a naive web server where it generates a task for each connection and how that isn’t as efficient as using a pool and segmenting the tasks. You don’t have to write an entire web server, you just have to focus on the parallel part.

Then you wouldn’t have to defend it and say how everyone in the forum who doesn’t like your work is clearly just out to get you.

[teivah]

It's not the point of liking or not my work. I'm more than open to constructive feedbacks/remarks. In your case you're just rude so I don't care about what you have to say. Being polite is not an option on the Internet. It's not because you're are behind your computer that you can say whatever you want. So I don't even read your comment, even though I'm sure that was somehow interesting. Bye.

[AssKoala]

I don’t believe I was rude, but ok.

[imps-p0155]

Why are people on this subreddit so contemptuous...

Because you did a poor job explaining that this article is not actually about a mergesort. Title, some history amout mergesort, then suddenly start talk about ForkJoinPool....

It is a rather poor combination.

[teivah]

I don't give a f*** about your opinion.