The efficiency of a sorting network can be measured by its total size, meaning the number of comparators in the network, or by its "depth", defined (informally) as the largest number of comparators that any input value can encounter on its way through the network.