<p><it>Abstract</it>—A nearly cost-optimal winner-take-all (WTA) neural network derived from a constant-time sorting network is presented. The resultant WTA network has connection complexity $<tmath>{\rm O}({\rm n}^{2^{\rm s}/(2^{\rm s} - 1)})</tmath>$ where s is the depth of cascaded sorting networks. Application of the WTA network to other problems such as nonbinary majority is also included.</p>