西 安月日JDK1.8.0+Eclpise3.2
二. 实验内容
(1).编程完成一维数组的排序
(2).编程分别计算两个矩阵相加和相乘
(3).编程统计一个字符串中给定字符出现的频率
三.方案设计
实验1.编程完成一维数组的排序
package work7;
import java.util.Arrays;
import java.util.Scanner;
public class SortArray
{
public static void main(String[] args)
{
Scanner s = new Scanner(System.in);
int[] a = new int[5];
int i;
System.out.println("请输入:");
for(i=0;i
{
a[i]=s.nextInt();
}
System.out.println("排序前的数组顺序:");
for(i=0;i
System.out.println(" "+a[i]);
Arrays.sort(a);
System.out.println("排序后:");
for(i=0;i
System.out.println(+a[i]);}
}
实验2.编程分别计算两个矩阵相加和相乘
package work7;
public class MulJuzhen
{
public static void main(String[] args)
{
int arrayA[][]={{1,2,3},
{4,5,6},
{7,8,9}};
int arrayB[][]={{1,2,3},
{4,5,6},
{7,8,9}};
int arrayC[][] = new int[3][3];
int arrayD[][] = new int[3][3];
int i,j,k;
for (i = 0;i <3;i++)
{
for (j = 0; j < 3; j++)
{
arrayC[i][j] = arrayA[i][j]+arrayB[i][j];
for (k = 0; k <3; k++)
{
arrayD[i][j] += arrayA[i][k]*arrayB[k][j];
}
System.out.print(arrayC[i][j]);
System.out.print(" ");
}
System.out.println();
}
System.out.println();
for (i = 0;i <3;i++)
{
for (j = 0; j < 3; j++)
{
System.out.print(arrayD[i][j]);
System.out.print(" ");
}
System.out.println();
}
}
}
实验3.编程统计一个字符串中给定字符出现的频率
package work7;
import java.util.*;
public class TestString
{
static String t = "aghuiaaaio";
public static double prob(String s,char c)
{
int time =0;
int i;
for(i=0;i
{
if(s.charAt(i)== c);
{
time++;
}
}
System.out.println("a出现的频率是:"+time);
return time;
}
public static void main(String[] args)
{
System.out.println(prob(t,'a'));
}
}
四.测试数据及运行结果
1.正常测试数据(3组)及运行结果:
实验1:
实验2: