We use inequalities to design short universal algorithms that can be used t
o generate random variates from large classes of univariate continuous or d
iscrete distributions (including all log-concave distributions). The expect
ed time is uniformly bounded over all these distributions. The algorithms c
an be implemented in a few lines of high-level language code. In opposition
to other black-box algorithms hardly any setup step is required, and thus
it is superior in the changing-parameter case.