Asymptotic Analysis - Vehicles Race and Algorithm Running Time
First, watch this video: Now, let's assume the vehicles, namely the Jet, the Car, and the Motorcycle are your algorithms. Also, suppose the length of the racecourse is the size of the data n . Consequently, the speed of the vehicles can be analogized to the running time of the algorithms. Eventually, if we had to embody the circumstances of this interesting race, we will obtain this (approximately): Supposedly, the respective vehicles speed closed-form: Which means: Formal Analysis: Let the instant between 0:24 and 0:30 be represented by n 0, instant 0:33 represented by n' 0 , and instant 0:36 by n'' 0 . The most interesting case to study, is T car (n), as it grows faster than T motorC (n) but slower than T jet (n). Critique: We notice that, if the length of the courserace was small, the motorcycle would have won this contest. The speed of the jet is exponentially larger than both the car and the mo...