几个算法的描述和时间复杂度的解释

/*

 * (1)-最大子序列求和问题
 * 4种算法的比较
 * (2)-若干个算法的比较
 * */


package Demo1;


public class MyAlgorithm {
/* 算法 1  O(N^3) */
public static  int maxSubSuml(int[] a){
int maxSum = 0;
for(int i=0;i<a.length;i++){
for(int j=i;j<a.length;j++){
int thisSum=0;
for(int k=i;k<=j;k++){
thisSum=thisSum+a[k];
}
if(thisSum>maxSum){
maxSum = thisSum;
}
}
}
return maxSum;
}
/* 算法 2 O(N^2) */
public static int maxSubSum2(int[] a){
int maxSum = 0;
for(int i=0;i<a.length;i++){
int thisSum=0;
for(int j=i;j<a.length;j++){
thisSum+=a[j];
if (thisSum>maxSum)
maxSum=thisSum;
}
}
return maxSum;
}
/* *** 算法 3 ***  
* "分治"的算法，数组分成两部分，然后是用递归解决
* arry example:int[] arr={4,-3,5,-2,-1,2,6,-2};the result is :11
* */
public static int maxSubSum3(int[] a,int left,int right){
if(left==right)//基准情况，必须有否则递归调用无效
if(a[left]>0)
return a[left];
else 
return 0;
/* 使用递归调用继续"分治" */
int center = (left+right)/2;
int maxLeftSum = maxSubSum3(a, left, center);
int maxRightSum = maxSubSum3(a, center+1, right);

int maxLeftBorderSum=0,leftBorderSum=0;
for(int i=0;i>=left;i--){
leftBorderSum+=a[i];
if(leftBorderSum>maxLeftBorderSum){
maxLeftBorderSum=leftBorderSum;
}
}

int maxRightBorderSum=0,rightBorderSum=0;
for(int i=center+1;i<=right;i++){
rightBorderSum+=a[i];
if(rightBorderSum>maxRightBorderSum){
maxRightBorderSum=rightBorderSum;
}
}
return max3(maxLeftSum,maxRightSum,maxLeftBorderSum+maxRightBorderSum);
}
public static int max3(int a,int b,int c){
int max=a;
if(b>max){
max=a;
}else if(c>max){
max=c;
}
return max;
}
/*
* --- 巧妙的算法 4 --- 
* */
public static int maxSubSum4(int[] a ){
int maxSum=0,thisSum=0;
for(int i=0;i<a.length;i++){
thisSum+=a[i];
if(thisSum>maxSum){
maxSum=thisSum;
}else if(thisSum<0){
thisSum=0;
}
}
return maxSum;
}
/*-------------------若干个算法-------------------*/
/* --- 折半算法 --- 
* 查找一个数字是否在数组中，是返回下标，否则返回-1
* */
public static <AnyType extends Comparable<? super AnyType>> int binarySearch(AnyType[] a,AnyType x){
int low=0,high=a.length-1;
while(low<=high){
int mid = (low+high)/2;
if(a[mid].compareTo(x)<0){
low = mid+1;
}else if(a[mid].compareTo(x)>0){
high=mid-1;
}else 
return mid;//发现该数字
}
return -1;//未发现该数字
}
/*   --- 欧几里得算法 ---
* 求解两个数的最大公因数，gcd(M,N)假设M>N
* */
public static long gcd (long m,long n){
while(n!=0){
long rem = m%n;
m=n;
n=rem;
}
return m;
}
/*--- 高效率的幂乘法 ---
* X^N:如果N是偶数---X^(N/2)*X^(N/2)
*     如果N是奇数---X^((N-1)/2) * N^((N-1)/2)*N
* */
public static long pow(long x,long n){
if(n==0)
return 1;
else if (n==1)
return x;
else if(x%2==0){//如果是偶数
return pow(x*x, n/2);
}else
return pow(x*x, (n-1)/2)*x;
}
/*---随机两个数互素的概率---
* 
* */
public static double proRwlPrim(int n){
int total=0,rel=0;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++){
total++;
if(gcd(i, j)==1)
rel++;
}
return (double)rel/total;
} 

/* 测试算法 */
public static void main(String[] args) {
//int[] test={-2,11,-4,13,-5,-2};//最大序列和是20
//int[] test_2={4,-3,5,-2,-1,2,6,-2};//最大子序列和11
//此处使用对象会提示警告，但仍然可以直接运行正确，因为是静态方法可以直接使用
//MyAlgorithm ma = new MyAlgorithm();
//int ra = MyAlgorithm.maxSubSuml(test);
//int ra = MyAlgorithm.maxSubSum2(test);
//int ra = MyAlgorithm.maxSubSum3(test_2,0,test_2.length-1);
//int ra = MyAlgorithm.maxSubSum4(test);
long ra = pow(3, 3);//3^3结果是27
System.out.println("the result is:"+ra);
}
}