文章目录
一、分治策略
1.定义:
是将规模比较大的问题可分割成规模较小的相同问题。问题不变,规模变小。这自然导致递归过程的产生。分治与递归像一对孪生兄弟,经常同时应用在算法设计之中,并由此产生许多高效算法。
2.特征
(1)该问题的规模缩小到一定的程度就可以容易地解决。
(2)该问题可以分解为若干个规模较小的相同问题。
(3)使用小规模的解,可以合并成该问题原规模的解。
(4)该问题所分解出的各个子规模是相互独立的。
3.递归
若一个函数直接地或间接地调用自己,则称这个函数是递归的函数。(简单地描述为“自己调用己”)。
3.1递归函数
递归函数的执行分为“递推”和“回归”两个过程,这两个过程由递归终止条件控制,即逐层递推,直至递归终止条件满足,种植递归,然后逐层回归。
递归调用同普通函数的调用一样,每当调用发生时,就要分配新的栈帧(型参数据,现场保护,局部变量),而与普通函数调用不同的是,由于递推的过程是一个逐层调用的过程,因此存在一个逐层连续的分配栈帧过程,直至遇到递归终止条件时,才开始回归,这时才逐层释放栈帧空间,返回到上一层,直至最后返回到主调函数。
凡是函数被调用,就要开辟栈帧
二、示例
1.例1
int fun(int n)//循环
{
int sum = 1;
for (int i = 1; i < n; ++i)
{
sum = sum * i;
}
return sum;
}
int fac(int n)//递归
{
if (n <= 1)
{
return 1;
}
else
{
return fac(n - 1);
}
}
2.例2
顺序打印
void Print(const int* br, int n)
{
if (n > 0)
{
Print(br, n - 1);//顺序打印
cout << br[n - 1] << " ";
//先执行上面语句进行递归,在倒过来执行三个输出函数进行打印
}
}
void Print_Ar(const int* br, int n)//递归
{
if (br == NULL || n < 1) return;
Print(br, n);
cout << endl;
}
int main()
{
int ar[] = { 12, 23, 34 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
return 0;
}
逆序打印
void Print(const int* br, int n)
{
if (n > 0)
{
cout << br[n - 1] << " ";
Print(br, n - 1);//逆序打印
}
}
void Print_Ar(const int* br, int n)//递归
{
if (br == NULL || n < 1) return;
Print(br, n);
cout << endl;
}
int main()
{
int ar[] = { 12, 23, 34 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
return 0;
}
栈溢出
void Print(const int* br, int n)
{
if (n > 0)
{
Print(br, n--);//栈溢出
cout << br[n - 1] << " ";
}
}
void Print_Ar(const int* br, int n)//递归
{
if (br == NULL || n < 1) return;
Print(br, n);
cout << endl;
}
int main()
{
int ar[] = { 12, 23, 34 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
return 0;
}
引用
void Print(const int* br, int& n)//引用每次打印都是相同的元素
{
if (n > 0)
{
Print(br, --n);
cout << br[n - 1] << " ";
}
}
void Print_Ar(const int* br, int n)//递归
{
if (br == NULL || n < 1) return;
Print(br, n);
cout << endl;
}
int main()
{
int ar[] = { 12, 23, 34 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
return 0;
}
3.例3:查找数组下标递归调用
int FindPos(const int* br, int n, int val)
{
if (br == NULL || n < 1) return -1;
int pos = n - 1;
while (pos >= 0 && br[pos] != val)
{
--pos;
}
return pos;
}
int Find(const int* br, int n, int val)
{
if (n <= 0 || br[n - 1] == val)
{
return n - 1;
}
else
{
return Find(br, n - 1, val);
}
}
三、排序算法(快速排序,归并排序,堆排序)
1.知识点
(1)时间复杂度 ?
(2)空间复杂度 ?
(3)稳定还是不稳定排序?
(4)排序退化
(5)排序算法如何选择?
(6)非递归排序
(7)在什么情况下快排速度会降低?
当要排序的数组是有序的时候,时间复杂度会变为n^2
2.快速排序算法
void Print_Ar(const int* br, int n)
{
if (br == NULL || n < 1) return;
for (int i = 0; i < n; ++i)
{
cout << br[i] << " ";
}
cout << endl;
}
int Parition(int* br, int left, int right)
{
int tmp = br[left];
while (left < right)
{
while (left < right && br[right]>tmp)
{
--right;
}
if (left < right)
{
br[left] = br[right];
}
while (left < right && br[left] <= tmp)
{
++left;
}
if (left < right)
{
br[right] = br[left];
}
}
br[left] = tmp;
return left;
}
void PassQuick(int* br, int left, int right)
{
if (left < right)
{
int pos = Parition(br, left, right);
PassQuick(br, left, pos - 1);
PassQuick(br, pos + 1, right);
}
}
void QuickSort(int* br, int n)
{
if (br == NULL || n < 2) return;
PassQuick(br, 0, n - 1);
}
int main()
{
int ar[] = { 56,12,78,90,34,23,100,56,45,67,89 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
QuickSort(ar, n);
Print_Ar(ar, n);
return 0;
}
3.非递归写法
#include<iostream>
#include<list>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
void Print_Ar(const int* br, int n)
{
if (br == NULL || n < 1) return;
for (int i = 0; i < n; ++i)
{
cout << br[i] << " ";
}
cout << endl;
}
int Parition(int* br, int left, int right)
{
int tmp = br[left];
while (left < right)
{
while (left < right && br[right]>tmp)
{
--right;
}
if (left < right)
{
br[left] = br[right];
}
while (left < right && br[left] <= tmp)
{
++left;
}
if (left < right)
{
br[right] = br[left];
}
}
br[left] = tmp;
return left;
}
void PassQuick(int* br, int left, int right)
{
if (left < right)
{
int pos = Parition(br, left, right);
PassQuick(br, left, pos - 1);
PassQuick(br, pos + 1, right);
}
}
void QuickSort(int* br, int n)//非递归排序算法
{
if (br == NULL || n < 2) return;
queue<int> qu;
qu.push(0);
qu.push(n - 1);
while (!qu.empty())
{
int left = qu.front();
qu.pop();
int right = qu.front();
qu.pop();
int pos = Parition(br, left, right);
if (left < pos - 1)
{
qu.push(left);
qu.push(pos - 1);
}
if (pos + 1 < right)
{
qu.push(pos + 1);
qu.push(right);
}
}
}
void QuickSort(int* br, int n)//递归排序算法
{
if (br == NULL || n < 2) return;
PassQuick(br, 0, n - 1);
}
int main()
{
int ar[] = { 56,12,78,90,34,23,100,56,45,67,89 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
QuickSort(ar, n);
Print_Ar(ar, n);
return 0;
}
4.pair对的用法
#include<iostream>
#include<list>
#include<vector>
#include<queue>
#include<stack>
#include<stdio.h>
using namespace std;
void Print_Ar(const int* br, int n)
{
if (br == NULL || n < 1) return;
for (int i = 0; i < n; ++i)
{
cout << br[i] << " ";
}
cout << endl;
}
int Parition(int* br, int left, int right)
{
int tmp = br[left];
while (left < right)
{
while (left < right && br[right]>tmp)
{
--right;
}
if (left < right)
{
br[left] = br[right];
}
while (left < right && br[left] <= tmp)
{
++left;
}
if (left < right)
{
br[right] = br[left];
}
}
br[left] = tmp;
return left;
}
void PassQuick(int* br, int left, int right)
{
if (left < right)
{
int pos = Parition(br, left, right);
PassQuick(br, left, pos - 1);
PassQuick(br, pos + 1, right);
}
}
void QuickSort(int* br, int n)//非递归排序算法
{
if (br == NULL || n < 2) return;
queue<int> qu;
qu.push(0);
qu.push(n - 1);
while (!qu.empty())
{
int left = qu.front();
qu.pop();
int right = qu.front();
qu.pop();
int pos = Parition(br, left, right);
if (left < pos - 1)
{
qu.push(left);
qu.push(pos - 1);
}
if (pos + 1 < right)
{
qu.push(pos + 1);
qu.push(right);
}
}
}
void QuickSort(int* br, int n)//递归排序算法
{
if (br == NULL || n < 2) return;
PassQuick(br, 0, n - 1);
}
void QuickSort(int* br, int n)//队排序算法(第一种)
{
if (br == NULL || n < 2) return;
queue<std::pair<int, int>> qu;
qu.push(std::pair<int, int>(0, n - 1));//左边和右边
while (!qu.empty())
{
std::pair<int, int> pos = qu.front();
qu.pop();
int mid = Parition(br, pos.first, pos.second);
if (pos.first < mid - 1)
{
qu.push(std::pair<int, int>(pos.first, mid - 1));
}
if (mid + 1 < pos.second)
{
qu.push(std::pair<int, int>(mid + 1, pos.second));
}
}
}
void QuickSort(int* br, int n)//队排序算法(第二种)
{
if (br == NULL || n < 2) return;
typedef std::pair<int, int> Pair;//typedef关键使程序更加清楚
queue<Pair> qu;
qu.push(Pair(0, n - 1));
while (!qu.empty())
{
Pair pos = qu.front();
qu.pop();
int mid = Parition(br, pos.first, pos.second);
if (pos.first < mid - 1)
{
qu.push(Pair(pos.first, mid - 1));
}
if (mid + 1 < pos.second)
{
qu.push(Pair(mid + 1, pos.second));
}
}
}
int main()
{
int ar[] = { 56,12,78,90,34,23,100,56,45,67,89 };
int n = sizeof(ar) / sizeof(ar[0]);
Print_Ar(ar, n);
QuickSort(ar, n);
Print_Ar(ar, n);
return 0;
}