This paper describes two algorithms for the generation of random packings of spheres with arbitrary diameter distribution. The first algorithm is the force-biased algorithm of Moscinski and Bargiel. It produces isotropic packings of very high density. The second algorithm is the Jodrey-Tory sedimentation algorithm, which simulates successive packing of a container with spheres following gravitation. It yields packings of a lower density and of weak anisotropy. The results obtained with these algorithms for the cases of log-normal and two-point sphere diameter distributions are analysed statistically, i.e. standard characteristics of spatial statistics such as porosity (or volume fraction). pair correlation function of the system of sphere centres and spherical contact distribution function of the set-theoretical union of all spheres are determined. Furthermore, the mean coordination numbers are analysed. These results are compared for both algorithms and with data from the literature based on other numerical simulations or from experiments with real spheres.