更新时间2018-12-08 05:23:52
#include <stdio.h>#include <stdlib.h>#define N 1000void LargestTow(int a[],int n,int *pfirst,int *psecond);int main(){ int a[N],n,i,j,*pfirst,*psecond; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } LargestTow(a,n,*pfirst,*psecond); printf("%d%d",*pfirst,*psecond); return 0;}void LargestTow(int a[],int n,int *pfirst,int *psecond){ int i,j,t; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(a[i]<a[j]) { t=a[i]; a[i]=a[j]; a[j]=t; } } } pfirst=&a[0]; psecond=&a[1];}
12345678910public class Arr{ //数组 int[] arr = {3,1,6,4,5,10,2}; //对数组进行简单的排序 java.util.Arrays.sort(arr); //输出最大值、最小值 System.out.println("最大值:" + arr[arr.length-1] +" 最小值:" + arr[0]); //从小到大输出 System.out.println(java.util.Arrays.toString(arr));}