Getting Started

Typically,as in insertion sort, the running time of an algorithm is fixed for a given input,although in later chapters we shall see some interesting "Randomized" algorithms whose behavior van vary even for a fixed input.

We usually consider one algorithm to be more efficient than another if its worst case running time has a lower order of growth.