Efficient implementation of inexact majority and median voters

Majority and median voters have been widely used in fault-tolerant systems. An efficient implementation of these voters not only decreases the time ov erhead but also improves their reliability and readability. The benefits of using a sori technique in the implementation of these voters is explained. The results indicate that the use of a sort technique decreases the order of computations from O(n(2)) to O(nlogn) for majority and from O(n(3)) to O (n(2)) for median voters.