本系列算法实现都是在学习数据结构(C++语言版),清华大学邓俊辉教授编,听邓老师edX网课过程中自己实现的例子。
问题:求出数组A[]中的最大值下标max1和次大值下标max2?
解决:用三种方法去实现
1 普通遍历两次
思路是全部便利一次找到最大值的下标max1,然后分成两段[low, max1)和[max1, high)分别便利找到两个可能的次大值,最后比较这两个次大值,最后得到max2.
算法复杂度为2n-3 = O(n)
//! array[low , high)
//! complexity = 2n-3
template <typename T>
void max2_usual(T a[], int low, int high, int& max1, int&max2)
{
//!find max of all
max1 = low;
for (int i = low + 1; i < high; ++i)
{
if (a[max1] < a[i])
max1 = i;
}
//! find maxl in [low, max1)
int _maxl = low;
for (int i = low; i < max1; ++i)
{
if (a[_maxl] < a[i])
_maxl = i;
}
//! find maxl in [max1+1, high)
int _maxr = max1 + 1;
for (int i = _maxr; i < high; ++i)
{
if (a[_maxr] < a[i])
_maxr = i;
}
max2 = a[_maxl] > a[_maxr] ? _maxl : _maxr;
}
2 只遍历一次
算法复杂度为最好是n-1,最差是2n-3 ,总的为 O(n),但是可以看到比起第一种算法已经改善。
//! array[low , high)
//! best complexity = 1 + n-2 = n-1
//! worst complexity = 1 + (n-2)*2 = 2n-3
template <typename T>
void max2_swap(T a[], int low, int high, int& max1, int&max2)
{
max1 = low;
max2 = low + 1;
if (a[max1] < a[max2])
swap(max1, max2);
for (int i = low + 2; i < high; ++i)
{
if (a[max2] < a[i])
{
max2 = i;
if (a[max1] < a[max2])
swap(max1, max2);
}
}
}
3 二分递归
原理图如下,图片来自于邓老师网络课程截图。
应用递归首先要找到递归基,经过分析此算法有两个递归基,分别是有2个元素和3个元素时,对应的判断条件为
//有2个元素
if (low + 2 == high)
{
// do somethin
return;
}
//有3个元素
if (low + 3 == high)
{
// do somethin
return;
}
其他需要注意的地方,
- 数组的区间边界问题
- 分成两部分递归后比较时一定要仔细
//! array[low , high)
//! best complexity = 1 + n-2 = n-1
//! worst complexity = 1 + (n-2)*2 = 2n-3
template <typename T>
void max2_recursion(T a[], int low, int high, int& max1, int&max2)
{
// recursion base1 : len(a)=2
if (low + 2 == high)
{
max1 = low;
max2 = low + 1;
if (a[low] < a[low + 1])
{
swap(max1, max2);
}
return;
}// recursion base1 end
//recursion base2 : len(a)=3
if (low + 3 == high)
{
cout << a[low] << " " << a[low + 1] << " " << a[low + 2] << endl;
max1 = low;
max2 = low + 1;
if (a[low] < a[low + 1])
swap(max1, max2);
if (a[max2] < a[low + 2])
{
max2 = low + 2;
if (a[max1] < a[max2])
swap(max1, max2);
}
return;
}// recursion base2 end
int middle = (low + high) / 2;//divided
int max1l, max2l, max1r, max2r; // divide 2 side and recursion
max2_recursion(a, low, middle, max1l, max2l);
max2_recursion(a, middle, high, max1r, max2r);
if (a[max1r] > a[max1l])
{
max1 = max1r;
max2 = a[max2r] > a[max1l] ? max2r : max1l;
}
else
{
max1 = max1l;
max2 = a[max2l] > a[max1r] ? max2l : max1r;
}
}