学习章节: 2.2分治
学习内容:
1、棋盘覆盖
在2^k * 2^k的棋盘中, 有一格被标记, 现要求用占3小格的'L'将棋盘完全覆盖并且不能重叠,求覆盖方法。
代码实现:
#include <stdio.h>
static int count = 0;
static int Board[8][8] = {0};
void ChessBoard(int lr, int lc, int sr, int sc, int size) //location row, column signed row, column
{
if (size == 1)
return;
int c = ++count;
int s = size/2;
if (sr < lr+s && sc < lc+s)
ChessBoard(lr, lc, sr, sc, s); //size减为一般,直接递归进入左上四分之一块
else
{
Board[lr+s-1][lc+s-1] = c; //Board数组记录下覆盖的过程
ChessBoard(lr, lc, lr+s-1, lc+s-1, s); //size减为一半, 将最这四分之一小块的最右下小格设置成标记的, 递归进入
}
if (sr > lr+s-1 && sc < lc+s) //左下四分之一小块
ChessBoard(lr+s, lc, sr, sc, s);
else
{
Board[lr+s][lc+s-1] = c;
ChessBoard(lr+s, lc, lr+s, lc+s-1, s);
}
if (sr < lr+s && sc > lc+s-1) //右上四分之一小块
ChessBoard(lr, lc+s, sr, sc, s);
else
{
Board[lr+s-1][lc+s] = c;
ChessBoard(lr, lc+s, lr+s-1, lc+s, s);
}
if (sr > lr+s-1 && sc > lc+s-1) //右下四分之一小块
ChessBoard(lr+s, lc+s, sr, sc, s);
else
{
Board[lr+s][lc+s] = c;
ChessBoard(lr+s, lc+s, lr+s, lc+s, s);
}
}
int main()
{
int i = 0, j = 0;
ChessBoard(0, 0, 4-1, 3-1, 8);
for (i = 0; i < 8; i++)
{
for (j = 0; j < 8; j++)
{
printf("%d\t", Board[i][j]);
}
printf("\n");
}
return 0;
}
输出:
2、合并排序算法
代码实现:
#include <stdio.h>
void MergeSort(int *, int *, int);
void MergePass(int *, int *, int, int);
void Merge(int *, int *, int, int, int);
//递归合并排序算法
/*
void MergeSort(int left, int right)
{
if(left < right)
{
int i = (left + right)/2;
MergeSort(a, left, i);
MergeSort(a, i+1, right);
Merge(a, b, left, i, right);
}
}
*/
//非递归合并排序算法
void MergeSort(int *a, int *b, int n)
{
//s=1, 第一次循环中第一次MergePass每两个数一组进行排序, 第二次MergePass每四个数一组进行排序,
//后面循环以此类推
//为什么要两次MergePass? 不会产生错误吗?
//两次MergePass为了让数组b中保存的结果存入数组a中完成排序
//假如已经完成排序, 数组b再进行MergePass将不进行Merge, 而是直接执行最后一句完全复制过去, 不会出错
int s = 1;
while (s < n)
{
MergePass(a, b, s, n);
s*=2;
MergePass(b, a, s, n);
s*=2;
}
}
void MergePass(int *a, int *b, int s, int n)
{
int i = 0, j = 0;
while (i <= n-2*s)
{
//保证从第一个元素开始, i+s-1=0
Merge(a, b, i, i+s-1, i+2*s-1);
i = i + 2*s;
}
if (i + s < n)
Merge(a, b, i, i+s-1, n-1);
else
for (j = i; j <=n-1; j++)
b[j] = a[j];
}
//start, middle, end
void Merge(int *x, int *y, int s, int m, int e)
{
int i = s, j = m+1, k = s, q = 0;
while(i <= m && j <= e)
if (x[i] <= x[j])
y[k++] = x[i++];
else
y[k++] = x[j++];
if (i > m)
for (q = j; q <= e; q++)
y[k++] = x[q];
else
for (q = i; q <= m; q++)
y[k++] = x[q];
}
int main()
{
int i;
int a[10] = {0};
int b[10] = {0};
for (i = 0; i < 10; i++)
{
a[i] = 10-i;
printf("%4d", a[i]);
}
printf("\n");
MergeSort(a, b, 10);
for (i = 0; i < 10; i++)
printf("%4d", a[i]);
printf("\n");
return 0;
}
3、快速排序算法
代码实现:
#include <stdio.h>
void QuickSort(int *, int, int);
int Partition(int *, int, int);
void Swap(int *, int *);
//pre为选中
void QuickSort(int *arr, int pre, int end)
{
if (pre < end)
{
int par = Partition(arr, pre, end);
QuickSort(arr, pre, par-1);
QuickSort(arr, par+1, end);
}
}
int Partition(int *arr, int pre, int end)
{
int i = pre;
int j = end+1;
int tmp = arr[pre];
while(1)
{
//当i=end时, j=end, 满足break
while (arr[++i] <= arr[pre] && i<end);
// 当j = pre时, arr[j] = arr[pre], 不加判断也会跳出此行的while, 此时i = pre,也满足下面的break
while (arr[--j] > arr[pre]);
if (i >= j)
break;
Swap(arr+i, arr+j);
}
arr[pre] = arr[j];
arr[j] = tmp;
return j;
}
void Swap(int *ap, int *bp)
{
int tmp = *ap;
*ap = *bp;
*bp = tmp;
}
int main()
{
int arr[] = {10, 9, 8, 7, 6, 5, 4, 3, 2, 1};
int i = 0;
for (i = 0; i < 10; i++)
printf("%4d", arr[i]);
printf("\n");
QuickSort(arr, 0, 9);
for (i = 0; i < 10; i++)
printf("%4d", arr[i]);
printf("\n");
return 0;
}
输出: