In this paper we would like to introduce an efficient variant of Bitonic sorting that can be used with sorting large arrays in distributed computing environment. The problem of sorting a collection of values on a mesh-connected distributed-memory computer using our sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setting the number of comparisons can be reduced asymptotically if the processors have addressing autonomy (locally indirect addressing), and communication costs can be reduced by careful placement of the data values.