ACM算法-时间复杂度分析(2.最坏,平均,最好时间复杂度分析)
2017-08-29 10:52
381 查看
Analysis of Algorithms | Set 2 (Worst, Average and Best Cases)
In the previous post, we discussed how Asymptotic analysis overcomes the problemsof naive way of analyzing algorithms. In this post, we will take an example of Linear Search and analyze it using Asymptotic analysis.
We can have three cases to analyze an algorithm:
1) Worst Case
2) Average Case
3) Best Case
Let us consider the following implementation of Linear Search.
#include <stdio.h> // Linearly search x in arr[]. If x is present then return the index, // otherwise return -1 int search(int arr[], int n, int x) { int i; for (i=0; i<n; i++) { if (arr[i] == x) return i; } return -1; } /* Driver program to test above functions*/ int main() { int arr[] = {1, 10, 30, 15}; int x = 30; int n = sizeof(arr)/sizeof(arr[0]); printf("%d is present at index %d", x, search(arr, n, x)); getchar(); return 0; }
Worst Case Analysis (Usually Done)
In the worst case analysis, we calculate upper bound on running time of an algorithm. We must know the case that causes maximum number of operations to be executed. For Linear Search, the worst case happens when the element to be searched (x in the above code)
is not present in the array. When x is not present, the search() functions compares it with all the elements of arr[] one by one. Therefore, the worst case time complexity of linear search would be Θ(n).
Average Case Analysis (Sometimes done)
In average case analysis, we take all possible inputs and calculate computing time for all of the inputs. Sum all the calculated values and divide the sum by total number of inputs. We must know (or predict) distribution of cases. For the linear search problem,
let us assume that all cases are uniformly distributed (including
the case of x not being present in array). So we sum all the cases and divide the sum by (n+1). Following is the value of average case time complexity.
Average Case Time = = = Θ(n)
Best Case Analysis (Bogus)
In the best case analysis, we calculate lower bound on running time of an algorithm. We must know the case that causes minimum number of operations to be executed. In the linear search problem, the best case occurs when x is present at the first location. The
number of operations in the best case is constant (not dependent on n). So time complexity in the best case would be Θ(1)
Most of the times, we do worst case analysis to analyze algorithms. In the worst analysis, we guarantee an upper bound on the running time of an algorithm which is good information.
The average case analysis is not easy to do in most of the practical cases and it is rarely done. In the average case analysis, we must know (or predict) the mathematical distribution of all possible inputs.
The Best Case analysis is bogus. Guaranteeing a lower bound on an algorithm doesn’t provide any information as in the worst case, an algorithm may take years to run.
For some algorithms, all the cases are asymptotically same, i.e., there are no worst and best cases. For example, Merge
Sort. Merge Sort does Θ(nLogn) operations in all cases. Most of the other sorting algorithms have worst and best cases. For example, in the typical implementation of Quick Sort (where pivot is chosen as a corner element), the worst occurs when the input
array is already sorted and the best occur when the pivot elements always divide array in two halves. For insertion sort, the worst case occurs when the array is reverse sorted and the best case occurs when the array is sorted in the same order as output.
相关文章推荐
- 快速排序最好,最坏,平均复杂度分析
- 各排序算法最好最坏平均情况下的时间复杂度
- 快速排序最好,最坏,平均复杂度分析
- 常见排序的最好,平均以及最坏时间复杂度
- 程序分析:最好,最坏和平均操作计数
- ACM算法-时间复杂度分析(3.渐进符号)
- 排序算法--时间复杂度(平均时间,最坏情况)、空间复杂度
- 最好最坏和平均情况下的性能分析
- ACM算法-时间复杂度分析(4.有关时间复杂度循环的分析)
- 快排最优时间复杂度,平均时间复杂度和最差时间复杂度分析
- 从顺序查找窥探平均时间复杂度分析的一般化方法
- 数据结构与算法的分析 —— 平均时间复杂度 vs 分摊时间复杂度
- 快排最优时间复杂度,平均时间复杂度和最差时间复杂度分析
- ACM算法-时间复杂度分析(1.渐进分析)
- 快速选择(QuickSelect)的平均时间复杂度分析
- 算法的时间复杂度分析
- 常用排序算法稳定性、时间复杂度分析
- 常用排序算法稳定性、时间复杂度分析
- LeetCode "Palindrome Partitioning"算法时间复杂度分析
- 快速排序算法及时间复杂度分析(原地in-place分区版本)