Imagine you could teleport to any forest on Earth. When you land, you have a 50 per cent chance of being within half a kilometre of the forest’s edge. That is how badly our planet’s forests have been sliced and […]

In The last lecture we study about – Big Oh notation

Figure 1.1 shows some of the run times to demonstrate how important it is to choose an efficient algorithm. For the sanity of our graph we have omitted cubic O […]

For run time complexity analysis we use big Oh notation extensively so it is vital that you are familiar with the general concepts to determine which is the best algorithm for you in certain scenarios. We have […]