An algorithm for calculating the discrepancy of finitely many points in the unit n-cube [0, 1] ⁿ is suggested. This algorithm is easy to program. For 2 ≤ n ≤ 4, the suggested algorithm is significantly faster than Bundschuh and Zhu's algorithm. For larger n, whether this algorithm is faster depends on the number of points.