Input sizeTime I1I1 T1T1 I2I2 T2T2 …… Algorithm Analysis We want to quantify the behavior of an algorithm. Useful to compare efficiency of two algorithms.
Adapting Quantum Error Correction to Specific Channels Peter Shor Massachusetts Institute of Technology Joint work with Andrew Fletcher and Ruitian Lang.
1 Chapter 24 Developing Efficient Algorithms. 2 Executing Time Suppose two algorithms perform the same task such as search (linear search vs. binary search)
Algorithm Correctness A correct algorithm is one in which every valid input instance produces the correct output. The correctness must be proved mathematically.