On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing