paper_crane的博客

#include #include void quickSort(int* arr, int start, int end) { if (start == end) { return; } int i = start, j = end; int cmpElement = arr[i]; while(i < j) {

#include #include typedef struct NodeList { struct NodeList* next; int data; }Node; Node* getList() { int number, i; Node* head = NULL; Node* tail = NULL; printf("请输入节点个数：");

#include #include int primes[1001] = {0}; int getPrimesCount() { int count = 0; for (int i = 2; i <= 1000; i++) { if (isPrime(i)) { primes[count++] = i; }