Thus the expected total number of resampling steps .
Therefore the expected runtime of the algorithm is at most n D ( \\ displaystyle ( \\ frac ( n ) ( D ) ) ) .
Thus the expected total number of resampling steps and therefore the expected runtime of the algorithm is at most n D ( \\ displaystyle ( \\ frac ( n ) ( D ) ) ) .