之前写过一些算法封装到自己写的头文件里面，今天突然想想到为什么不把那些重复的事情，重复没有意义的代码自己封装一下，然后使用的时候就很舒服了。于是我就加入到了之前写的头文件内
#ifndef FUNC_H
#define FUNC_H
#include<vector>
#include<algorithm>
#include <iostream>
#include<string>
#include<iterator>
#include<list>
#include<array>
namespace sort_ {
void merge(int arr[], int start, int end, int mid, int* temp) {
int i_start = start;
int i_end = mid;
int j_start = mid + 1;
int j_end = end;
int Length = 0;
while (i_start <= i_end && j_start <= j_end) {
if (arr[i_start] < arr[j_start])
temp[Length++] = arr[i_start++];
else
temp[Length++] = arr[j_start++];
}
while (i_start <= i_end) {
temp[Length++] = arr[i_start++];
}
while (j_start <= j_end) {
temp[Length++] = arr[j_start++];
}
for (int i = 0; i < Length; i++) {
arr[start + i] = temp[i];
}
}
void mergeSort(int arr[], int start, int end, int* temp) {
if (start >= end) {
return;
}
int mid = (start + end) / 2;
mergeSort(arr, start, mid, temp);
mergeSort(arr, mid + 1, end, temp);
merge(arr, start, end, mid, temp);
}
//快排
template<typename T>
void quickSort(int left, int right, std::vector<T>& arr) {
if (left >= right)
return;
int i = left, j = right, base = arr[left];//取最左边的数为基准数
while (i < j) {
while (arr[j] >= base && i < j)
j--;
while (arr[i] <= base && i < j)
i++;
if (i < j) {
std::swap(arr[i], arr[j]);
}
}
arr[left] = arr[i];
arr[i] = base;
quickSort(left, i - 1, arr);
quickSort(i + 1, right, arr);
}
template<typename T>
void quickSort(int left, int right, T arr[]) {
if (left >= right)
return;
int i = left, j = right, base = arr[left];//取最左边的数为基准数
while (i < j) {
while (arr[j] >= base && i < j)
j--;
while (arr[i] <= base && i < j)
i++;
if (i < j) {
std::swap(arr[i], arr[j]);
}
}
arr[left] = arr[i];
arr[i] = base;
quickSort(left, i - 1, arr);
quickSort(i + 1, right, arr);
}
//选择
template<typename T>//从小到大升序
void selectSort(T arr[], int len) {
for (int i = 0; i < len; i++) {
int min = i;
for (int j = i + 1; j < len; j++) {
if (arr[j] < arr[min]) {
min = j;
}
}
if (min != i) {
std::swap(arr[min], arr[i]);
}
}
}
template<typename T>
void Inverted(T n[], int str, int end) { //数组逆置
if (str < end) {
std::swap(n[str], n[end]);
Inverted(n, str + 1, end - 1);
}
return;
}
template<typename T>
int sum(T n[], int start, int end) {
if (start == end)return n[start];
int mid = (start + end) >> 1;
return sum(n, start, mid) + sum(n, mid + 1, end);
}//二分递归，数组求和
double average(int n[], int start, int end) {
return sum(n, start, end) / static_cast<double>(end + 1);
}//二分递归，数组求和
int fib(int n) {
return n <= 2 ? 1 : fib(n - 1) + fib(n - 2);
}//时间复杂度O(2^n)，空间消耗很高
int fib2(int n) {
int f = 0, g = 1;
while (0 < n--) {
g = g + f;
f = g - f;
}
return g;
}//时间复杂度O(n),空间复杂度只需要O(1)
}
namespace find_ {
template<typename Comparable>
int binarySearch(const std::vector<Comparable>& a, const Comparable& x)
{
int low = 0, hight = a.size()-1;
while (low <= hight)
{
int mid = (low + hight) / 2;
if (a[mid] < x) {
low = mid + 1;
}
else if (a[mid] > x) {
hight = mid - 1;
}
else
return mid; //找到的情况
}
return -1;
}
template<typename Comparable>
int binarySearch(const Comparable *a, const Comparable x,Comparable len)
{
int low = 0, hight =len-1 ;
while (low <= hight)
{
int mid = (low + hight) / 2;
if (a[mid] < x) {
low = mid + 1;
}
else if (a[mid] > x) {
hight = mid - 1;
}
else
return mid; //找到的情况
}
return -1;
}
}
namespace pow_ {
double pow_(int x, size_t n)
{
if (n == 0)
return 1;
if (n == 1)
return x;
if (n % 2 == 0)
return pow_(x * x, n / 2);
else
return pow_(x * x, n / 2) * x;
}
double pow_(int x, int n)
{
n = -n;
return 1 / pow_(x, static_cast<size_t>(n));
}
}
namespace maxAmin {
template<typename T,size_t size>
auto max(T(&n)[size]) {
T Max{};
for (size_t i = 0; i < size; i++) {
if (n[i] > Max)Max = n[i];
}
return Max;
}
template<typename T>
auto max(std::vector<T>n) {
T Max{};
for (size_t i = 0; i < n.size(); i++) {
if (n[i] > Max)Max = n[i];
}
return Max;
}
template<typename T, size_t size>
auto min(T(&n)[size]) {
T Min = n[0];
for (size_t i = 1; i < size; i++) {
if (n[i] < Min)Min = n[i];
}
return Min;
}
template<typename T>
auto min(std::vector<T>n) {
T Min = n[0];
for (size_t i = 1; i < n.size(); i++) {
if (n[i] < Min)Min = n[i];
}
return Min;
}
}
namespace show_ {
template<typename T,size_t i>
void print(const T(&n)[i], const std::string s=" ") {
std::copy(std::begin(n),std::end(n), std::ostream_iterator<T, char>(std::cout, s.data()));//s做分隔符
std::cout << std::endl;
}
template<typename T,size_t size>
void print(const std::array<T,size> v, const std::string s = " ") {
std::copy(std::begin(v), std::end(v), std::ostream_iterator<T, char>(std::cout, s.data()));//s做分隔符
std::cout << std::endl;
}
void print(const char* s) {
std::cout << s << std::endl; //重载特殊情况，字符串常量输出
}
template<typename T>
void print(const std::vector<T>n,const std::string s=" ") {
std::copy(std::begin(n), std::end(n), std::ostream_iterator<T, char>(std::cout, s.data()));//s做分隔符
std::endl(std::cout);
}
template<typename T>
void print(const T v) {
std::cout << v << std::endl;
}
template<typename T>
void print(const std::list<T>& L,std::string s=" ") {
for (auto it = L.begin(); it != L.end(); it++) { //list容器版本
std::cout << *it << s;
}
std::cout << std::endl;
}
template<typename...Args> //折叠表达式，用于输出一堆东西
void prints(Args...args) {
((std::cout << args << ","), ...);
}
}
namespace file_ {
}
#endif 今天主要写的是命名空间show_的部分，测试了挺久，其他的一些算法不少是之前写的，有简单的，也有麻烦一点的，c++的algorithm也提供大量算法，适用于几乎所有的数据类型，我尽量不重复写它的，主要是为了方便，明天把file的写好即可，我们下面附上测试的代码
#include"func.h"
using namespace show_;//引入命名空间,所以写不写命名空间都行
int main()
{
int n[10]{ 1,2,3,4,5,6,7,8,9,10 };
std::vector<double>i{ 1.2,3,5,4,8,7,9,10,11,30.8 };
std::cout << ::sort_::average(n, 0, 9) << std::endl;
std::cout << ::sort_::sum(n, 0, 9) << std::endl;
::sort_::Inverted(n, 0, 9);//逆置
for (auto i : n)std::cout << i << ",";
std::endl(std::cout);
std::cout << ::maxAmin::max(i) << "," << ::maxAmin::max(n) << std::endl;
std::cout << ::maxAmin::min(i) << "," << ::maxAmin::min(n) << std::endl;
show_::print(n,",");
show_::print(n);
show_::print(i);
show_::print(i,"*");
show_::prints(1, 2, 3, 4, 5, "666", "阿巴巴");
show_::print("可怕");
show_::print(5.7);
show_::print(std::string("离谱"));
print('5');
print(std::move(12));
show_::print(std::move(n));
std::array<int, 5>v{ 1,2,3,4,5 };
print(v);
std::list<double>L{ 1.2,3.4,5.6,7.8,9,10,11,12 };
print(L);
print(L, ",");
int a = 5;
print(&a);
return 0;
}诸位的编译器至少要支持c++17放可正常使用，我测试的环境是MSVC C++20，debug。好了明天见
