PSP个体软件过程作业

个体软件过程1、输入n个数（实数或整数），输出其最大最小值。

#include<stdio.h>int main(){int a,n,max,min;while(scanf("%d",&n)==1){printf("now input %d integers: ",n);scanf("%d",&a);max = min = a;for(int i = 1;i < n;i++){scanf("%d",&a);if(a > max) max = a;if(a < min) min = a;}printf("The biggest number is %d,and the smallest is %d:!\n",max,min);}return 0;}2、输入n个数和一个整数K, 输出n个数中第K个最大最小值。

要求有输入错误判断及相应错误信息。

#include<iostream>using namespace std;#include<algorithm>int main(){double arr[10000];int n;while(scanf("%lf",&n)==1){printf("input the %d elements: ",n);for(int i = 0;i < n;i++){scanf("%lf",&arr[i])if(arr[i]-(int)arr[i]!=0){printf("This number is not a integer!begin the next!\n");flag = 0;break;}}if(!flag) continue;sort(arr,arr+n);printf("Now input K: ");scanf("%d",&k);printf("The %dth biggest element is :%.0lf\n",k,arr[n-k]);}return 0;}3、输入n个数，用任意算法对其进行排序并按从小到大顺序输出。

#include<iostream>using namespace std;#include<algorithm>int main(){double arr[10000];int n;while(scanf("%lf",&n)==1){printf("input the %d elements: ",n);for(int i = 0;i < n;i++){scanf("%lf",&arr[i])if(arr[i]-(int)arr[i]!=0){printf("This number is not a integer!begin the next!\n");flag = 0;break;}}if(!flag) continue;sort(arr,arr+n);printf("Now input K: ");scanf("%d",&k);printf("The %dth biggest element is :%.0lf\n",k,arr[n-k]);}return 0;}4、对给定一个英文文本文件，统计并输出26个英文字母（不区分大小写）的出现频率，并统计定冠词‘the’的出现次数及频率。

package javaexample;import java.util.*;public class tongji {/*** @param args* @author ranmaosheng*/public static void main(String[] args){String a;Scanner sc = new Scanner(System.in);System.out.println("Please input the line you want to test:");while(sc.hasNextLine()){a = sc.nextLine();System.out.println("The line you tape in is: "+a);String a1=a.toLowerCase();double b = a1.length();int start = 0;int ia=0,ib=0,ic=0,id=0,ie=0,iF=0,ig=0,ih=0,ii=0,ij=0,ik=0,il=0,im=0,in=0,io=0,ip=0,iq=0,ir=0,is=0,it=0 ,iu=0,iv=0,iw=0,ix=0,iy=0,iz=0;char c;while(start<b){c=a1.charAt(start);switch(c){case'a':ia++;break;case'b':ib++;break;case'c':ic++;case'd': id++;break; case'e': ie++;break; case'f': iF++;break; case'g': ig++;break; case'h': ih++;break; case'i': ii++;break; case'j': ij++;break; case'k': ik++;break; case'l': il++;break; case'm': im++;break; case'n': in++;break; case'o': io++;break; case'p': ip++;break; case'q': iq++;break; case'r':break;case's':is++;break;case't':it++;break;case'u':iu++;break;case'v':iv++;break;case'w':iw++;break;case'x':ix++;break;case'y':iy++;break;case'z':iz++;break;default: break;}start++;}System.out.println("A或a出现的频率是："+ia/(b+1)*100+"%");System.out.println("B或b出现的频率是："+ib/(b+1)*100+"%");System.out.println("C或c出现的频率是："+ic/(b+1)*100+"%");System.out.println("D或d出现的频率是："+id/(b+1)*100+"%");// TODO Auto-generated method stubSystem.out.println("E或e出现的频率是："+ie/(b+1)*100+"%");System.out.println("F或f出现的频率是："+iF/(b+1)*100+"%");System.out.println("G或g出现的频率是："+ig/(b+1)*100+"%");System.out.println("H或h出现的频率是："+ih/(b+1)*100+"%");System.out.println("I或i出现的频率是："+ii/(b+1)*100+"%");System.out.println("J或j出现的频率是："+ij/(b+1)*100+"%");System.out.println("K或k出现的频率是："+ik/(b+1)*100+"%");System.out.println("L或l出现的频率是："+il/(b+1)*100+"%");System.out.println("M或m出现的频率是："+im/(b+1)*100+"%");System.out.println("N或n出现的频率是："+in/(b+1)*100+"%");System.out.println("O或o出现的频率是："+io/(b+1)*100+"%");System.out.println("P或p出现的频率是："+ip/(b+1)*100+"%");System.out.println("Q或q出现的频率是："+iq/(b+1)*100+"%");System.out.println("R或r出现的频率是："+ir/(b+1)*100+"%");System.out.println("S或s出现的频率是："+is/(b+1)*100+"%");System.out.println("U或u出现的频率是："+iu/(b+1)*100+"%");System.out.println("V或v出现的频率是："+iv/(b+1)*100+"%");System.out.println("W或w出现的频率是："+iw/(b+1)*100+"%");System.out.println("X或x出现的频率是："+ix/(b+1)*100+"%");System.out.println("Y或y出现的频率是："+iy/(b+1)*100+"%");System.out.println("Z或z出现的频率是："+iz/(b+1)*100+"%");String d=a1.trim();int e = d.length();char f;String the;int start1=0;double count1=0,count2=0;while(start1<e){if(d.charAt(start1)==''||d.charAt(start1)==','||d.charAt(start1)=='.'||d.charAt(start1)=='!'||d.charAt(start1)=='?'||d.charAt(start1)==';'|| d.charAt(start1)==':')count1++;start1++;}int f1=0;char f2;f1=d.indexOf("the",0);//f2=d.charAt(f1+3);while(f1>=0 ){f2=d.charAt(f1+3);if(f2==''||f2==','||f2=='.'||f2=='?'||f2=='!'||f2==':'||f2==';')count2++;f1=d.indexOf("the",f1+1);}System.out.println("在语句中The或the出现的次数是："+count2);System.out.println("在语句中The或the出现的频率是："+count2/(count1+1)*100+"%");}}}5、任意输入一个带有+,-,x,/和（）的算术表达式，输出表达式的值。