English: When selecting points in mentioned order points A, B, C, D are going to be fixed by the algorithm, but at most 3 should be fixed. Patch would be to guarantee the radius of the maintained circle never decreases. Matousek, Sharir, Welzl correcteed it in following paper. Sufficient correction is to exclude the last 4 points from the random selection unless there are no other points remaining. Fixed point replaces the point remaining fourth. Then radius for last 4 points never decreases and algorithm works well. Oops the original algorithm ends recurrence immediately when there are 3 fixed points, even when the subresult does not enclose entire subset. In that case there is point on the stack (when less then 3 points are fixed) which is outside the subresulting disc. So this point would be fixed and algorithm recovers. What are consequences to the algorithm's time complexity?