This article proposes an election algorithm for the hypercube; it exchanges less than messages and uses O(2 N) time (where N is the size of the cube). A randomized version of the algorithm achieves the same (expected) asymptotic message and time bounds, but uses messages of only O( N) bits and can be used in anonymous hypercubes.