目录

排序算法

数据类型范围

 快速幂

排序算法

(10条消息) 超详细十大经典排序算法总结（java代码）c或者cpp的也可以明白_Top_Spirit的博客-CSDN博客_排序算法总结https://blog.csdn.net/weixin_41190227/article/details/86600821?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164808231316780261940067%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=164808231316780261940067&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-2-86600821.142%5Ev3%5Epc_search_result_control_group,143%5Ev4%5Eregister&utm_term=%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95&spm=1018.2226.3001.4187(10条消息) C++实现常用八大排序算法—实现及其对比_YAIMZA的博客-CSDN博客_排序算法c++https://blog.csdn.net/qq_37941471/article/details/80710099?ops_request_misc=&request_id=&biz_id=102&utm_term=%E6%8E%92%E5%BA%8F%E7%AE%97%E6%B3%95C++&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduweb~default-0-80710099.142%5Ev3%5Epc_search_result_control_group,143%5Ev4%5Eregister&spm=1018.2226.3001.4187

数据类型范围

 快速幂

算法学习笔记(4)：快速幂 - 知乎 (zhihu.com)https://zhuanlan.zhihu.com/p/95902286

//递归快速幂
int qpow(int a, int n)
{
    if (n == 0)
        return 1;
    else if (n % 2 == 1)
        return qpow(a, n - 1) * a;
    else
    {
        int temp = qpow(a, n / 2);
        return temp * temp;
    }
}

//递归快速幂（对大素数取模）
#define MOD 1000000007
typedef long long ll;
ll qpow(ll a, ll n)
{
    if (n == 0)
        return 1;
    else if (n % 2 == 1)
        return qpow(a, n - 1) * a % MOD;
    else
    {
        ll temp = qpow(a, n / 2) % MOD;
        return temp * temp % MOD;
    }
}