Traditional search algorithms for computer hologram generation such as Direct Search and Simulated Annealing offer some of the best hologram qualities at convergence when compared to rival approaches. Their slow generation times and high processing power requirements mean, however, that they see little use in performance critical applications. This paper presents the novel sorted pixel selection (SPS) modification for holographic search algorithms that offers mean square error reductions in the range of 14.7-19.2% for the test images used. SPS operates by substituting a weighted search selection procedure for traditional random pixel selection processes. While small, the improvements seen are observed consistently across a wide range of test cases and require limited overhead for implementation.