上游充通大 ParisTech SHANGHAI JIAO TONG UNIVERSITY INSTITUT DES SCIENCES ET TECHNOLOGIES PARIS INSTITUTE OF TECHNOLOGY Comparing Algorithms While interesting,can we guarantee that these empirical results are not dependent on the type of computer they were conducted on,the amount of memory in the computer,the speed of the computer,etc.? We could abstractly reason about the algorithms to determine how efficient they are.We can assume that the algorithm with the fewest number of“steps”is more efficient. 2020 Comparing Algorithms • While interesting, can we guarantee that these empirical results are not dependent on the type of computer they were conducted on, the amount of memory in the computer, the speed of the computer, etc.? • We could abstractly reason about the algorithms to determine how efficient they are. We can assume that the algorithm with the fewest number of “steps” is more efficient