That makes for highly different competitive ratios ranging from course to course, with some being most disputed ( in 2010, medicine and law had 23 and 17 students disputing one vacancy, respectively ) and some having a worryingly low demand ( in 2010, mathematics had only 12 applicants for 20 vacancies ).
22.
If we let OPT ( X ) be the number of operations performed by the strictly optimal tree for an access sequence X, we can say that a tree is dynamically optimal as long as, for any X, it performs X in time O ( OPT ( X ) ) ( that is, it has a constant competitive ratio ).
