2015江西理工大学算法设计与分析期末复习题.docxVIP

说明：2015年秋季考试编程题基本是复习题前面的编程题里面的几道，选择题都在复习题里面的选择题里面。1、设计一个O（n的平方）时间的算法，找出由n个数组成的序列的最长单调递增子序列int main(){int n;scanf(%d,n);int a[100];for(int i=0;in;i++)scanf(%d,a[i]);printf(%d\n,LISdyna(a,n));}int LISdyna(int a[],int n){int b[100]={0};int i,j;b[0]=1;for(i=1;in;i++){int k=0;for(j=0;ji;j++)if(a[j]=a[i]kb[j]) k=b[j];b[i]=k+1;}int max=0;for(i=0;in;i++)if(b[i]max) max=b[i];return max;}2、哈夫曼编码程序实现private static class Huffman implements Comparable{Bintree tree;float weight;private Huffman(Bintree tt,float ww){tree=tt;weight=ww;}public int compareTo(Object x){float xw=((Huffman)x),weight;if(weightxw)return-1;if(weight==xw)return 0;return 1;}} 3、在n个元素在找出一特定元素X。Public static int binarySearch(int[]a,int x,int n){int left=0;int right=n-1; while(left=right){int middle=(left+right)/2;if(x==a[middle]) return middle;if(xa[middle]) left=middle+1;else right=middle-1;} return-1;}4、编程求解最长公共子序列public static int lcsLength(char[]x,char[]y,int[][]b){int m=x.length-1;int n=y.length-1;int [][]c=new int[m+1][n+1];for(int i=1;i=m;i++) c[i][0]=0; for(int i=1;i=n;i++) c[0][i]=0; for(int i=1;i=m;i++) for(int j=1;j=n;j++){if(x[i]==y[j]){c[i][j]=c[i-1][j-1]+1; b[i][j]=1; } else if(c[i-1][j]=c[i][j-1]){c[i][j]=c[i-1][j];b[i][j]=2;}else {c[i][j]=c[i][j-1];b[i][j]=3; } } return c[m][n];} 5、最小生成树编程（prim算法）public static void prim(int n,float[][]c){float[]lowcost=new float[n+1]；int[]closest=new int[n+1];boolean[]s=new boolean[n+1];s[1]=true;for(int i=2;i=n;i++){lowcost[i]=c[1][i];closest[i]=1;s[i]=false;} for(int i=1;in;i++){float min=Float.MAX_VALUE;int j=1;for(int k=2;k=n;k++)if((lowcost[k]min)(! s[k])){min=lowcost[k];j=k; }System.out.println(j+, +closest[j]);s[j]=true;for(int k=2;k=n;k++)if((c[j][k]lowcost[k])(! s[k])){lowcost[k]=c[j][k];closest[k]=j; } }} 6、最小生成树编程（Kruskal算法）static class EdgeNode implements Comparable{float weight;int u,v;EdgeNode(int uu,int vv,float ww){u=uu;v=vv;weight=ww;}public int compareTo(Object x){double xw=((EdgeNode)x).weig