Zecheng's Blog

New post every day (with probability 0.000000003).

保研机试训练Day-01

Sorting && High precision

大纲排序算法快排 #include<iostream> using namespace std; const int N=1e6+10; int n; int q[N]; void quick_sort(int q[],int l,int r){ if(l>=r) return; int x=q[(l+r)/2] , i = l - 1,...

Posted by Jeffzzc on March 20, 2025