So even though the running time of such an algorithm, a subroutine, is patently theta of N, it does constant work for each of N entries, so it's exactly theta of N, we'll often just say that it has running time O of N. We won't bother to make the stronger statement that it's theta of N. The reason we do that is because you know, as algorithm designers, what we really care about is upper bounds. 