Understanding Complexity (Urban Traffic VS Highway Traffic)
Sometimes, algorithmic complexity, when approached academically, or mathematically, might go astray its literal meaning. Indeed, algorithmic complexity is described using theoretic mathematical expressions, and referred to basically by using Big O notation. As a matter of fact, algorithmic complexity has a picturesque meaning. Indeed, sometimes a bad algorithm is the one that has a pointless high complexity, and any experienced programmer can easily find for optimisation. Reducing complexity can sometimes mean that an unnecessary recalculation is repeatedly done. Sometimes, a value needs to be calculated only by using a formula rather than using (nested) loops etc. A real life situation is traffic in the city versus traffic in the highway. The distance between home and downtown is 10 km, but it takes me 45 minutes to reach my destionation, taking into account traffic lights, intersections, the tramway ... Whereas, the distance between home and a former job loca...