在编程的世界里，C语言作为一种历史悠久且功能强大的编程语言，至今仍被广泛使用。无论是操作系统、嵌入式系统还是大型应用软件，C语言都扮演着不可或缺的角色。为了帮助读者深入理解C语言，本文将详细解析50个经典编程案例，涵盖数据结构、算法、文件操作、网络编程等多个方面。
1. 数据结构
1.1 链表操作
案例描述：实现单链表的基本操作，包括创建链表、插入节点、删除节点和遍历链表。
代码示例：
#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));
newNode->data = data;
newNode->next = NULL;
return newNode;
}
// 插入节点
void insertNode(Node** head, int data) {
Node* newNode = createNode(data);
newNode->next = *head;
*head = newNode;
}
// 删除节点
void deleteNode(Node** head, int data) {
Node* temp = *head, *prev = NULL;
if (temp != NULL && temp->data == data) {
*head = temp->next;
free(temp);
return;
}
while (temp != NULL && temp->data != data) {
prev = temp;
temp = temp->next;
}
if (temp == NULL) return;
prev->next = temp->next;
free(temp);
}
// 遍历链表
void traverseList(Node* head) {
Node* temp = head;
while (temp != NULL) {
printf("%d ", temp->data);
temp = temp->next;
}
printf("\n");
}
int main() {
Node* head = NULL;
insertNode(&head, 3);
insertNode(&head, 2);
insertNode(&head, 1);
printf("Original List: ");
traverseList(head);
deleteNode(&head, 2);
printf("List after deleting 2: ");
traverseList(head);
return 0;
}
1.2 栈操作
案例描述：实现栈的基本操作，包括创建栈、入栈、出栈和判断栈空。
代码示例：
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 100
typedef struct Stack {
int data[MAX_SIZE];
int top;
} Stack;
// 创建栈
Stack* createStack() {
Stack* stack = (Stack*)malloc(sizeof(Stack));
stack->top = -1;
return stack;
}
// 入栈
void push(Stack* stack, int data) {
if (stack->top == MAX_SIZE - 1) {
printf("Stack is full\n");
return;
}
stack->data[++stack->top] = data;
}
// 出栈
int pop(Stack* stack) {
if (stack->top == -1) {
printf("Stack is empty\n");
return -1;
}
return stack->data[stack->top--];
}
// 判断栈空
int isEmpty(Stack* stack) {
return stack->top == -1;
}
int main() {
Stack* stack = createStack();
push(stack, 1);
push(stack, 2);
push(stack, 3);
printf("Stack: ");
while (!isEmpty(stack)) {
printf("%d ", pop(stack));
}
printf("\n");
return 0;
}
2. 算法
2.1 冒泡排序
案例描述：实现冒泡排序算法，对一组数据进行升序排序。
代码示例：
#include <stdio.h>
void bubbleSort(int arr[], int n) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
int main() {
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr) / sizeof(arr[0]);
bubbleSort(arr, n);
printf("Sorted array: \n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}
2.2 快速排序
案例描述：实现快速排序算法，对一组数据进行升序排序。
代码示例：
#include <stdio.h>
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++;
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
int temp = arr[i + 1];
arr[i + 1] = arr[high];
arr[high] = temp;
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: \n");
for (int i = 0; i < n; i++) {
printf("%d ", arr[i]);
}
printf("\n");
return 0;
}
3. 文件操作
3.1 文件读取
案例描述：从文件中读取数据，并将读取的数据打印到控制台。
代码示例：
#include <stdio.h>
int main() {
FILE* file = fopen("data.txt", "r");
if (file == NULL) {
printf("Error opening file\n");
return -1;
}
int data;
while (fscanf(file, "%d", &data) != EOF) {
printf("%d ", data);
}
fclose(file);
return 0;
}
3.2 文件写入
案例描述：将数据写入文件。
代码示例：
#include <stdio.h>
int main() {
FILE* file = fopen("data.txt", "w");
if (file == NULL) {
printf("Error opening file\n");
return -1;
}
int data;
for (int i = 0; i < 10; i++) {
fprintf(file, "%d\n", i);
}
fclose(file);
return 0;
}
4. 网络编程
4.1 TCP客户端
案例描述：实现一个TCP客户端，连接到服务器并发送数据。
代码示例：
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/socket.h>
#include <netinet/in.h>
int main() {
int sock = socket(AF_INET, SOCK_STREAM, 0);
if (sock < 0) {
printf("Error creating socket\n");
return -1;
}
struct sockaddr_in server;
server.sin_family = AF_INET;
server.sin_port = htons(8080);
server.sin_addr.s_addr = inet_addr("127.0.0.1");
if (connect(sock, (struct sockaddr*)&server, sizeof(server)) < 0) {
printf("Error connecting to server\n");
return -1;
}
char buffer[1024];
printf("Enter message: ");
fgets(buffer, 1024, stdin);
send(sock, buffer, strlen(buffer), 0);
int valread = read(sock, buffer, 1024);
printf("Server response: %s\n", buffer);
close(sock);
return 0;
}
4.2 TCP服务器
案例描述：实现一个TCP服务器，监听客户端连接并接收数据。
代码示例：
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/socket.h>
#include <netinet/in.h>
int main() {
int server_fd, new_socket;
struct sockaddr_in address;
int opt = 1;
int addrlen = sizeof(address);
if ((server_fd = socket(AF_INET, SOCK_STREAM, 0)) == 0) {
printf("Could not create socket\n");
return -1;
}
if (setsockopt(server_fd, SOL_SOCKET, SO_REUSEADDR | SO_REUSEPORT, &opt, sizeof(opt))) {
printf("setsockopt\n");
return -1;
}
address.sin_family = AF_INET;
address.sin_addr.s_addr = INADDR_ANY;
address.sin_port = htons(8080);
if (bind(server_fd, (struct sockaddr*)&address, sizeof(address)) < 0) {
printf("bind failed\n");
return -1;
}
if (listen(server_fd, 3) < 0) {
printf("listen\n");
return -1;
}
if ((new_socket = accept(server_fd, (struct sockaddr*)&address, (socklen_t*)&addrlen)) < 0) {
printf("accept\n");
return -1;
}
char buffer[1024] = {0};
read(new_socket, buffer, 1024);
printf("Client message: %s\n", buffer);
send(new_socket, "Hello from server", 18, 0);
close(new_socket);
return 0;
}
通过以上50个经典编程案例的解析，相信读者对C语言的理解会更加深入。在学习和实践过程中，请不断积累经验，逐步提高自己的编程能力。祝您学习愉快！