Big O and Performance

We are very interested in performance of algorithms and how the cost of an algorithm increases as the size of the problem increases. Cost can include:

The terms efficiency and complexity are also used.

Contents    Page-10    Prev    Next    Page+10    Index