- 博客(2)
- 收藏
- 关注
RSS订阅原创 xiaoji
includeint quickmin(int a, int b, int c) { int sum = 1; a = a%c; while (b > 0) { if (b & 1) { sum = (sum*a) % c; } a = (a*a)%c;
2017-12-02 20:00:06
157
原创 关于快排
“`“`void quicksort(int a[], int left, int right) { if (left >= right) { return; } int c = left; int b = right; int spot = a[left]; while (c < b) {
2017-12-02 00:06:37
156
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人