We will assume that basic operations take constant time.

Later, we will consider some exceptions to this assumption:

• Some library functions may take more than O(1) time. We will want to be conscious of the Big O of library functions.

• Memory access may be affected by paging and cache behavior.

• There may be hidden costs such as garbage collection.

Contents    Page-10    Prev    Next    Page+10    Index