实验目的:
1)通过分治算法设计分析与实现实验,理解分治思想;
2)掌握分治法解题步骤;
3)学习运用分治法分析并解决实际问题。
实验要求:
(1)利用分治法,分析与设计二分搜索算法,并实现在[2,7,9,12,17,20,26,29,31,32,33,43,45]中查找元素20的问题;
package 算法实验;
import java.util.*;
public class t1 {
public static void main(String[] args) {
int[] a={2,7,9,12,17,20,26,29,31,32,33,43,45};
Scanner sc=new Scanner(System.in);
System.out.println("请输入要搜索的数:");
int x=sc.nextInt();
int bin=Binary(a,x,a.length-1);
System.out.println("该值的下标为:");
System.out.println(bin);
}
private static int Binary(int[] a, int x, int i) {
int left=0;
int right=i-1;
while (left<=right) {
int mid=(left+right)/2;
if(x==a[mid])
return mid;
if(x>a[mid])
return mid+1;
else
return mid-1;
}
return 0;
}
}
结果
(2)利用分治法,分析与设计棋盘覆盖算法,并实现k=3的特殊棋盘覆盖问题。`
package 算法实验;
public class t2 {
int tile=1;
int [][] board=new int[8][8];
public void QP(int tr,int tc,int dr,int dc,int size) {
if(size==1)
return;
int t=tile++;
int s=size/2;
if(dr<tr+s&&dc<tc+s)
QP(tr,tc,dr,dc,s);
else {
board[tr+s-1][tc+s-1]=t;
QP(tr,tc,tr+s-1,tc+s-1,s);
}
if(dr<tr+s&&dc>=tc+s)
QP(tr,tc+s,dr,dc,s);
else {
board[tr+s-1][tc+s]=t;
QP(tr,tr+s,tr+s-1,tc+s,s);
}
if(dr>=tr+s&&dc<tc+s)
QP(tr+s,tc,dr,dc,s);
else {
board[tr+s][tc+s-1]=t;
QP(tr+s,tc,tr+s,tc+s-1,s);
}
if(dr>=tr+s&&dc>=tc+s)
QP(tr+s,tc+s,dr,dc,s);
else {
board[tr+s][tc+s]=t;
QP(tr+s,tc+s,tr+s,tc+s,s);
}
}
public static void main(String[] args) {
t2 c=new t2();
c.QP(0,0,3,4,8);
for(int i=0;i<8;i++)
{
for(int j=0;j<8;j++)
System.out.printf("%5d",c.board[i][j]);
System.out.println();
}
}
}
结果