Since each insertion and deletion requires O(1) amortized time, the total deterministic time is T(n) = T(2n/3) + O(n).
Posto svako umetanje i brisanje zahteva O(1) vremena, ukupno determinističko vreme je T(n)=T(2n/3)+O(n).