随着编程技术的不断发展，C语言作为一种历史悠久且功能强大的编程语言，在嵌入式系统、操作系统、游戏开发等领域仍然占据着重要地位。掌握C语言，尤其是阅读和理解C源码，对于提升编程技能至关重要。本文将分享一些实用的C源码，帮助读者提升编程水平。

一、基础数据结构实现

1.链表

链表是一种常见的数据结构，以下是一个单向链表的实现：

`c

include <stdio.h>

include <stdlib.h>

typedef struct Node { int data; struct Node* next; } Node;

// 创建新节点 Node createNode(int data) { Node newNode = (Node*)malloc(sizeof(Node)); if (newNode == NULL) { printf("Memory allocation failed!\n"); exit(1); } newNode->data = data; newNode->next = NULL; return newNode; }

// 插入节点 void insertNode(Node** head, int data) { Node newNode = createNode(data); newNode->next = head; *head = newNode; }

// 打印链表 void printList(Node* head) { while (head != NULL) { printf("%d ", head->data); head = head->next; } printf("\n"); }

// 主函数 int main() { Node* head = NULL; insertNode(&head, 1); insertNode(&head, 2); insertNode(&head, 3); printList(head); return 0; } `

2.栈

栈是一种后进先出（LIFO）的数据结构，以下是一个栈的实现：

`c

include <stdio.h>

include <stdlib.h>

define MAX_SIZE 100

typedef struct Stack { int data[MAX_SIZE]; int top; } Stack;

// 初始化栈 void initStack(Stack* s) { s->top = -1; }

// 判断栈是否为空 int isEmpty(Stack* s) { return s->top == -1; }

// 判断栈是否已满 int isFull(Stack* s) { return s->top == MAX_SIZE - 1; }

// 入栈 void push(Stack* s, int data) { if (isFull(s)) { printf("Stack is full!\n"); return; } s->data[++s->top] = data; }

// 出栈 int pop(Stack* s) { if (isEmpty(s)) { printf("Stack is empty!\n"); return -1; } return s->data[s->top--]; }

// 主函数 int main() { Stack s; initStack(&s); push(&s, 1); push(&s, 2); push(&s, 3); printf("Pop: %d\n", pop(&s)); printf("Pop: %d\n", pop(&s)); printf("Pop: %d\n", pop(&s)); return 0; } `

二、实用算法实现

1.快速排序

以下是一个快速排序的实现：

`c

include <stdio.h>

void swap(int a, int b) { int temp = a; a = b; b = temp; }

int partition(int arr[], int low, int high) { int pivot = arr[high]; int i = low - 1; for (int j = low; j <= high - 1; j++) { if (arr[j] < pivot) { i++; swap(&arr[i], &arr[j]); } } swap(&arr[i + 1], &arr[high]); return (i + 1); }

void quickSort(int arr[], int low, int high) { if (low < high) { int pi = partition(arr, low, high); quickSort(arr, low, pi - 1); quickSort(arr, pi + 1, high); } }

int main() { int arr[] = {10, 7, 8, 9, 1, 5}; int n = sizeof(arr) / sizeof(arr[0]); quickSort(arr, 0, n - 1); printf("Sorted array: "); for (int i = 0; i < n; i++) { printf("%d ", arr[i]); } printf("\n"); return 0; } `

2.合并排序

以下是一个合并排序的实现：

`c

include <stdio.h>

include <stdlib.h>

void merge(int arr[], int l, int m, int r) { int i, j, k; int n1 = m - l + 1; int n2 = r - m;

int L[n1], R[n2];
for (i = 0; i < n1; i++)
    L[i] = arr[l + i];
for (j = 0; j < n2; j++)
    R[j] = arr[m + 1 + j];
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
        arr[k] = L[i];
        i++;
    } else {
        arr[k] = R[j];
        j++;
    }
    k++;
}
while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
}
while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
}

}

void mergeSort(int arr[], int l, int r) { if (l < r) { int m = l + (r - l) / 2;

    mergeSort(arr, l, m);
    mergeSort(arr, m + 1, r);
    merge(arr, l, m, r);
}

}

int main() { int arr[] = {12, 11, 13, 5, 6, 7}; int arr_size = sizeof(arr) / sizeof(arr[0]);

printf("Given array is \n");
for (int i = 0; i < arr_size; i++)
    printf("%d ", arr[i]);
printf("\n");
mergeSort(arr, 0, arr_size - 1);
printf("\nSorted array is \n");
for (int i = 0; i < arr_size; i++)
    printf("%d ", arr[i]);
printf("\n");
return 0;

} `

三、实用工具函数实现

1.字符串拷贝

以下是一个字符串拷贝的实现：

`c

include <stdio.h>

include <string.h>

void strCopy(char dest, const char src) { while (src) { dest++ = src++; } dest = '\0'; }

int main() { char src[] = "Hello, World!"; char dest[50];

strCopy(dest, src);
printf("Copied string: %s\n", dest);
return 0;

} `

2.字符串比较

以下是一个字符串比较的实现：

`c

include <stdio.h>

include <string.h>

int strCompare(const char s1, const char s2) { while (s1 && (s1 == s2)) { s1++; s2++; } return (const unsigned char)s1 - (const unsigned char*)s2; }

int main() { const char s1 = "Hello"; const char s2 = "Hello"; const char* s3 = "World";

printf("s1 == s2: %d\n", strCompare(s1, s2));
printf("s1 == s3: %d\n", strCompare(s1, s3));
return 0;

} `

总结

本文分享了几个实用的C源码，包括基础数据结构、实用算法和工具函数的实现。通过学习和理解这些源码，可以帮助读者提升C语言编程技能，为以后的开发工作打下坚实基础。希望本文对大家有所帮助！