#include <iostream>
using namespace std;
const int N = 100010;
int q[N];
void quick_sort(int q[], int l, int r)
{
if (l >= r) return;
int i = l - 1, j = r + 1, x = q[l + r >> 1];
while (i ...
| English Article | Word Count | Duration | Accuracy | Speed | Backspace | Error | Slogan |
|---|---|---|---|---|---|---|---|
| 《快速排序》 | 580字 | 3.5分钟 | 100% | 137 CPM | 50 次 | 1 | 及格，继续努力！ |
| The wrong word this time: } | |||||||
|
Suggestion:
可能对按键不够熟悉，或者对输入法不够熟练所导致，不要急慢慢来，先打对把准确率提高，然后逐渐的加快速度，最后才能打准打快。
|
|||||||
| Inspirational quotes: 富贵必从勤苦得。 ——杜甫 | |||||||
| What do you think of this article? Give it a rating and let it serve as a guiding light for others | |||||||
Registration with the Ministry of Industry and Information Technology: Min ICP No. 19000005