Paulliant的博客

排序算法可以说是从语言步入算法的第一道坎了，其中最有代表性的莫过于快排。这里模拟库函数自带sort的调用方式，写起来相当自然清爽。朴素快速排序算法的复杂度最好为O(nlogn)，最坏时能达到O(n²)#include<iostream>#include<cmath>#include<cstdio>#include<cstdlib>#inclu...

迪杰斯特拉算法（Dijkstra's Algorithm）解决单源最短路问题的优秀算法，堆优化后时间复杂度降到O((m+n)logn)。#include<iostream>#include<cmath>#include<cstdio>#include<cstdlib>#include<cstring>#include<al...

克鲁斯卡尔算法（Kruskal's Algorithm）#include<iostream>#include<cmath>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#define FOR(i,x,y) for(int i...

此模板封装了中国剩余定理等函数，支持同余方程插入。#include<iostream>#include<cmath>#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#define FOR(i,x,y) for(int i...