Worst case , calculating the set corresponding with such a property , of the form size ( x ) = maxm , for example , involves sorting the distractors as to their size , which may amount to O ( n2d ) or O ( nd log nd ) calculations ( depending on the sorting algorithm : cfXXX [ Aho et al. 1983 ] Chapter 8 ) .
data structures and algorithms
Alfred V Aho John E Hopcroft Jeffrey D Ullman
In a vague description , the property last added to the description is context dependent . Worst case , calculating the set corresponding with such a property , of the form size ( x ) = maxm , for example , involves sorting the distractors as to their size , which may amount to O ( n2d ) or O ( nd log nd ) calculations ( depending on the sorting algorithm : cfXXX [ Aho et al. 1983 ] Chapter 8 ) . Once again , the most time-consuming part of the calculation can be performed off-line , since it is the same for all referring expressions .
Worst case , calculating the set corresponding with such a property , of the form size ( x ) = maxm , for example , involves sorting the distractors as to their size , which may amount to O ( n2d ) or O ( nd log nd ) calculations ( depending on the sorting algorithm : cfXXX [ @@CITATION ] Chapter 8 ) .