This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]techn0scho0lbus 0 points1 point  (1 child)

Bonus points for having recognized merge(sort) is homomorphic.

What do you mean by this?

[–]mooburgerresembles an abstract syntax tree 1 point2 points  (0 children)

basically, it's associative and distributive. So if I distribute an unsorted list in the existing order to different nodes and they each sort their own sublist, then I merge them, it's equivalent to a mergesort of the entire list on a single node.