import edu.princeton.cs.algs4.StdOut;
import edu.princeton.cs.algs4.StdRandom;
import edu.princeton.cs.algs4.Stopwatch;
public class E1_4_19 {
public static void main(String[]args){
//测试是否正确
int[][]a={
{1, 2, 15, 4, 5},
{6, 7, 0, 8, 9},
{10, 11, 12, 13, 14}};
int[]index=LocalMinArray(a);
StdOut.println("index=("+index[0]+","+index[1]+")");
//Doubling Ratio test
int N=125;
double prev=timeTrial(N);
for (N=250;true;N+=N){
double now=timeTrial(N);
StdOut.printf("N=%10d time=%7.1f ratio=%6.1f\n",N,now,now/prev);
prev=now;
}
}
public static double timeTrial(int N){
int MAX=1000000;
int[][]a=new int[N][N];
for (int i=0;i<N;i++)//不
算法第四版1.4算法分析:习题1.4.19
最新推荐文章于 2021-02-25 08:20:48 发布