A benchmarking procedure for sparse linear array synthesis methods is proposed. Our approach is based on the comparison of the performance of the array synthesis algorithm under test with the performance of a reference solution based on a optimally equispaced array. The benchmark procedure is demonstrated considering some examples regarding sparse synthesis method proposed in literature. Guidelines for the correct comparison of synthesis methods and some “tough problems” for the test of new sparse synthesis algorithms are also provided.