Multiple choice:Comparison of algorithm efficiency
Comparison of algorithm efficiency
The time complexity of some algorithms to solve a certain problem is as follows, among which ▁▁▁▁▁▁▁▁▁@[ D](1)
A. $$O(n)$$
B. $$O(n^2)$$
C. $$O(2^n)$$
D. $$O(n!)$$
A.$$O(n)$$
B.$$O(n^2)$$
C.$$O(2^n)$$
D.$$O(n!)$$
answer：D
The time complexity of some algorithms to solve a certain problem is as follows, among which ▁▁▁▁▁▁▁▁▁@[ D](1)
A. $$O(n)$$
B. $$O(n^2)$$
C. $$O(2^n)$$
D. $$O(n!)$$
A.$$O(n)$$
B.$$O(n^2)$$
C.$$O(2^n)$$
D.$$O(n!)$$
answer：D
