<Tr> <Th> Notation </Th> <Th> Name </Th> <Th> Examples </Th> </Tr> <Tr> <Td> O (1) (\ displaystyle O (1) \,) </Td> <Td> constant </Td> <Td> Finding the median from a sorted list of measurements; Using a constant - size lookup table; Using a suitable hash function for looking up an item . </Td> </Tr> <Tr> <Td> O (log ⁡ n) (\ displaystyle O (\ log n) \,) </Td> <Td> logarithmic </Td> <Td> Finding an item in a sorted array with a binary search or a balanced search tree as well as all operations in a Binomial heap . </Td> </Tr> <Tr> <Td> O (n) (\ displaystyle O (n) \,) </Td> <Td> linear </Td> <Td> Finding an item in an unsorted list or a malformed tree (worst case) or in an unsorted array; Adding two n - bit integers by ripple carry . </Td> </Tr>

The performance of an algorithm is most closely related to what