Question

We can represent an n-input comparison network with c comparators as a list of c pairs of integers in the range from 1 to n. If two pairs contain an integer in common, the order of the corresponding comparators in the network is determined by the order of the pairs in the list. Given this representation, describe an O (n + c)-time (serial) algorithm for determining the depth of a comparison network


$1.99
Sales0
Views319
Comments0
  • CreatedJuly 14, 2010
  • Files Included
Post your question
5000