经典的数据结构——数组反转、链表反转、冒泡排序

1、数组反转

void reversech(char ch[]){int len = strlen(ch);for (int i=0; i< len/2; ++i){char temp = ch[i];ch[i] = ch[len-1-i];ch[len-1-i] = temp;}}

2、链表反转

PNode reverse(PNode head){PNode prev = NULL;PNode node = head;PNode child = node->next;while (node){child = node->next;node->next = prev;prev = node;node = child;}return prev;}

3、冒泡排序

void bubble_sort(int a[], int n){int i, j, temp;for (j = 0; j < n - 1; j++)for (i = 0; i < n - 1 - j; i++){if(a[i] > a[i + 1]){temp = a[i];a[i] = a[i + 1];a[i + 1] = temp;}}}

以上代码都可以运行。

---------------------