正在加载图片...
Average-Case Analysis of Algorithms We focus on computing the runing time of various algorithms When the running time of an algorithm is different for different inputs of the same size,we can think of the running time of the algorithm as a random variable on the sample space of inputs,and thus,we can analyze the expected running time of the algorithm.This gives us an understanding different from studying just the worst-case runing time for an input of a given size.Average-Case Analysis of Algorithms
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有