|
Test
Your EQ #150— Answer
|
Answer
7
A 2-input sort requires one module, and each Nth input
adds N–1 modules. The sum of this series is N×(N–1)/2.
A 16-input sort would require 120 modules. There may be
a more efficient solution. Can you find it?
Contributor:
M.K.
Suvarnakuma
Published:
January-2003
