So we're going to expose a couple of assumptions in our analysis, we're focus on worst case behavior, ... ... or we'll look for guarantees on performance on running time that hold for every possible input on a given size, ... and then we'll also expose our focus on so called "Asymptotic Analysis", which meaning will be much more concerned with the rate of growth on an algorithms performance than on things like low-order terms or on small changes in the constant factors. 