1-3
写一个通用方法用于判定给定数组是否已排好序。
解: 分析问题:
1.满足从小到大或从大到小 2.满足各种合法的数据类型 3.满足负数,零和正数
//C++实现
template <class T>//使用模板
bool IsSorted(T* a, int n) {
int Lower = 0;
int Higher = 0;
for (i = 0; i < n; i++) {
if (a[i] > a[i+1]) Lower ++;
if (a[i] < a[i+1]) Higher ++;
if (a[i] == a[i+1]) {
Lower++;Higher++;}}
if ((Lower == i) || (Higher == i )) return true;
return false;
}
1-4
求下列函数的渐进表达式。
( 1 ) 3 n 2 + 10 n (1)3n^2+10n (1)3n2+10n ( 2 ) n 2 / 10 + 2 n (2) n^2/10+2^n (2)n2/10+2n ( 3 ) 21 + 1 / n (3)21+1/n (3)21+1/n ( 4 ) log n 3 (4) \log n^3 (4)logn3 ( 5 ) 10 log 3 n (5) 10\log 3^n (5)10log3n
解: 分析问题:
算法复杂性的关系: O ( 1 ) < O ( log n ) < O ( n log n ) < O ( n ) < O ( n 2 ) < O ( n 3 ) < ⋯ < O ( n m ) < O ( 2 n ) < O ( n ! ) < O ( n n ) O(1)<O(\log n)<O(n\log n)<O(n)<O(n^2)<O(n^3)<\cdots<O(n^m)<O(2^n)<O(n!)<O(n^n) O(1)<O(logn)<O(nlogn)<O(n)<O(n2)<O(n3)<⋯<O(nm)<O(2n)<O(n!)<O(nn)
( 1 ) 3 n 2 + 10 n = O ( n 2 ) (1) 3n^2+10n=O(n^2) (1)3n2+10n=O(n2) ( 2 ) n 2 / 10 + 2 n = O ( 2 n ) (2) n^2/10+2^n=O(2^n) (2)n2/10+2n=O(2n) ( 3 ) 21 + 1 / n = O ( 1 ) (3)21+1/n=O(1) (3)21+1/n=O(1)
( 4 ) log n 3 = 3 log n = O ( log n ) (4)\log n^3=3\log n=O(\log n) (4)logn3=3logn=O(logn) ( 5 ) 10 log 3 n = ( 10 log 3 ) n = O ( n ) (5)10\log 3^n=(10\log 3)n=O(n)