While they all use different approaches, like divide and conquer or comparison sorting, they all have one fundamental aim: to sort random shuffles of integers into order.

Study proposes a communication-efficient, divide and conquer algorithm that combines information from sub-machines using confidence distributions. The theoretical relationship between the number ...