掌握C語言，10個實戰案例助你快速上手

提問者：用戶BGKU 發布時間： 2025-05-23 00:32:50 閱讀時間： 3分鐘

最佳答案

1. 打算器順序

一個簡單的打算器順序可能幫助你懂得C言語的基本語法跟把持構造。以下是一個基本的打算器順序示例：

#include <stdio.h>

int main() {
    char operator;
    double firstNumber, secondNumber;

    printf("Enter an operator (+, -, *, /): ");
    scanf("%c", &operator);

    printf("Enter two operands: ");
    scanf("%lf %lf", &firstNumber, &secondNumber);

    switch (operator) {
        case '+':
            printf("%.1lf + %.1lf = %.1lf", firstNumber, secondNumber, firstNumber + secondNumber);
            break;
        case '-':
            printf("%.1lf - %.1lf = %.1lf", firstNumber, secondNumber, firstNumber - secondNumber);
            break;
        case '*':
            printf("%.1lf * %.1lf = %.1lf", firstNumber, secondNumber, firstNumber * secondNumber);
            break;
        case '/':
            if (secondNumber != 0.0)
                printf("%.1lf / %.1lf = %.1lf", firstNumber, secondNumber, firstNumber / secondNumber);
            else
                printf("Division by zero is not allowed.");
            break;
        default:
            printf("Error! operator is not correct");
    }

    return 0;
}

2. 字符串處理

利用C言語處理字符串，例照實現字符串反轉：

#include <stdio.h>
#include <string.h>

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

int main() {
    char str[] = "Hello, World!";
    printf("Original String: %s\n", str);
    reverseString(str);
    printf("Reversed String: %s\n", str);
    return 0;
}

3. 行列實現

進修怎樣利用C言語實現行列數據構造：

#include <stdio.h>
#include <stdlib.h>

#define MAX 100

int queue[MAX];
int front = -1;
int rear = -1;

void enqueue(int item) {
    if (rear == MAX - 1) {
        printf("Queue is full\n");
    } else {
        if (front == -1) {
            front = 0;
        }
        rear++;
        queue[rear] = item;
    }
}

int dequeue() {
    int item;
    if (front == -1) {
        printf("Queue is empty\n");
        return -1;
    } else {
        item = queue[front];
        if (front == rear) {
            front = -1;
            rear = -1;
        } else {
            front++;
        }
        return item;
    }
}

int main() {
    enqueue(1);
    enqueue(2);
    enqueue(3);
    printf("%d dequeued from queue\n", dequeue());
    printf("%d dequeued from queue\n", dequeue());
    return 0;
}

4. 函數遞歸

遞歸函數是一個重要的不雅點，以下是一個利用遞歸打算階乘的示例：

#include <stdio.h>

long factorial(int n) {
    if (n == 0)
        return 1;
    else
        return n * factorial(n - 1);
}

int main() {
    int number;
    printf("Enter a positive integer: ");
    scanf("%d", &number);
    printf("Factorial of %d = %ld\n", number, factorial(number));
    return 0;
}

5. 排序算法

實現一個排序算法，如冒泡排序，來懂得C言語中的輪回跟比較邏輯：

#include <stdio.h>

void bubbleSort(int arr[], int n) {
    int i, j, temp;
    for (i = 0; i < n-1; i++) {
        for (j = 0; j < n-i-1; j++) {
            if (arr[j] > arr[j+1]) {
                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;
}

6. 鏈表操縱

利用C言語實現鏈表數據構造，並停止拔出跟刪除操縱：

#include <stdio.h>
#include <stdlib.h>

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

void push(struct Node** head_ref, int new_data) {
    struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));
    new_node->data = new_data;
    new_node->next = (*head_ref);
    (*head_ref) = new_node;
}

void deleteNode(struct Node** head_ref, int key) {
    struct Node *temp = *head_ref, *prev;

    if (temp != NULL && temp->data == key) {
        *head_ref = temp->next;
        free(temp);
        return;
    }

    while (temp != NULL && temp->data != key) {
        prev = temp;
        temp = temp->next;
    }

    if (temp == NULL) return;

    prev->next = temp->next;
    free(temp);
}

void printList(struct Node *node) {
    while (node != NULL) {
        printf("%d ", node->data);
        node = node->next;
    }
    printf("\n");
}

int main() {
    struct Node* head = NULL;

    push(&head, 1);
    push(&head, 3);
    push(&head, 2);

    printf("Created Linked list is: ");
    printList(head);

    deleteNode(&head, 1);
    printf("Linked List after Deletion of 1: ");
    printList(head);

    return 0;
}

7. 文件操縱

進修怎樣利用C言語停止文件操縱，比方讀取跟寫入文件：

#include <stdio.h>

int main() {
    FILE *fp;
    char ch;

    fp = fopen("example.txt", "r");
    if (fp == NULL) {
        printf("Error opening file\n");
        return 0;
    }

    printf("Reading characters from file:\n");
    while ((ch = fgetc(fp)) != EOF) {
        printf("%c", ch);
    }

    fclose(fp);
    return 0;
}

8. 收集編程

利用C言語停止基本的收集編程，比方創建一個簡單的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);

    // Creating socket file descriptor
    if ((server_fd = socket(AF_INET, SOCK_STREAM, 0)) == 0) {
        perror("socket failed");
        exit(EXIT_FAILURE);
    }

    // Forcefully attaching socket to the port 8080
    if (setsockopt(server_fd, SOL_SOCKET, SO_REUSEADDR | SO_REUSEPORT, &opt, sizeof(opt))) {
        perror("setsockopt");
        exit(EXIT_FAILURE);
    }
    address.sin_family = AF_INET;
    address.sin_addr.s_addr = INADDR_ANY;
    address.sin_port = htons(8080);

    // Forcefully attaching socket to the port 8080
    if (bind(server_fd, (struct sockaddr *)&address, sizeof(address))<0) {
        perror("bind failed");
        exit(EXIT_FAILURE);
    }

    if (listen(server_fd, 3) < 0) {
        perror("listen");
        exit(EXIT_FAILURE);
    }

    while ((new_socket = accept(server_fd, (struct sockaddr *)&address, (socklen_t*)&addrlen))) {
        printf("Connection accepted\n");
        char buffer[1024] = {0};
        read(new_socket, buffer, 1024);
        send(new_socket, "Hello from server", 18, 0);
        close(new_socket);
    }

    if (new_socket < 0) {
        perror("accept");
        exit(EXIT_FAILURE);
    }

    return 0;
}

9. 圖形用戶界面編程

利用C言語結合GTK庫停止圖形用戶界面編程：

#include <gtk/gtk.h>

static void activate(GtkApplication* app, gpointer user_data) {
    GtkWidget *window;

    window = gtk_application_window_new(app);
    gtk_window_set_title(GTK_WINDOW(window), "GTK Application");
    gtk_window_set_default_size(GTK_WINDOW(window), 300, 200);

    gtk_container_set_border_width(GTK_CONTAINER(window), 10);

    GtkWidget *label = gtk_label_new("Hello, GTK!");
    gtk_window_set_child(GTK_WINDOW(window), label);

    gtk_widget_show(window);
}

int main(int argc, char **argv) {
    GtkApplication *app;
    int status;

    app = gtk_application_new("org.gtk.example", G_APPLICATION_FLAGS_NONE);
    g_signal_connect(app, "activate", G_CALLBACK(activate), NULL);
    status = g_application_run(G_APPLICATION(app), argc, argv);
    g_object_unref(app);

    return status;
}

10. 數據庫連接

利用C言語連接Oracle數據庫，履行SQL語句：

”`c #include #include #include

int main() {

OCIEnv *envhp;
OCIServer *srvhp;
OCISession *seshp;
OCISessionPool *sesp;
OCIError *errhp;
ub4 n = 0;
ub4 r = 0;
ub4 nattr = 0;
ub4 rattr = 0;
ub4 column;
ub4 row;
ub4 colcount = 0;
ub4 rowcount = 0;
ub4 size = 0;
ub4 colsize = 0;
ub4 rowsize = 0;
ub4 len = 0;
ub4 type = 0;
ub4 len2 = 0;
ub4 type2 = 0;
ub4 len3 = 0;
ub4 type3 = 0;
ub4 len4 = 0;
ub4 type4 = 0;
ub4 len5 = 0;
ub4 type5 = 0;
ub4 len6 = 0;
ub4 type6 = 0;
ub4 len7 = 0;
ub4 type7 = 0;
ub4 len8 = 0;
ub4 type8 = 0;
ub4 len9 = 0;
ub4 type9 = 0;
ub4 len10 = 0;
ub4 type10 = 0;
ub4 len11 = 0;
ub4 type11 = 0;
ub4 len12 = 0;
ub4 type12 = 0;
ub4 len13 = 0;
ub4 type13 = 0;
ub4 len14 = 0;
ub4 type14 = 0;
ub4 len15 = 0;
ub4 type15 = 0;
ub4 len16 = 0;
ub4 type16 = 0;
ub4 len17 = 0;
ub4 type17 = 0;
ub4 len18 = 0;
ub4 type18 = 0;
ub4 len19 = 0;
ub4 type19 = 0;
ub4 len20 = 0;
ub4 type20 = 0;
ub4 len21 = 0;
ub4 type21 = 0;
ub4 len22 = 0;
ub4 type22 = 0;
ub4 len23 = 0;
ub4 type23 = 0;
ub4 len24 = 0;
ub4 type24 = 0;
ub4 len25 = 0;
ub4 type25 = 0;
ub4 len26 = 0;
ub4 type26 = 0;
ub4 len27 = 0;
ub4 type27 = 0;
ub4 len28 = 0;
ub4 type28 = 0;
ub4 len29 = 0;
ub4 type29 = 0;
ub4 len30 = 0;
ub4 type30 = 0;
ub4 len31 = 0;
ub4 type31 = 0;
ub4 len32 = 0;
ub4 type32 = 0;
ub4 len33 = 0;
ub4 type33 = 0;
ub4 len34 = 0;
ub4 type34 = 0;
ub4 len35 = 0;
ub4 type35 = 0;
ub4 len36 = 0;
ub4 type36 = 0;
ub4 len37 = 0;
ub4 type37 = 0;
ub4 len38 = 0;
ub4 type38 = 0;
ub4 len39 = 0;
ub4 type39 = 0;
ub4 len40 = 0;
ub4 type40 = 0;
ub4 len41 = 0;
ub4 type41 = 0;
ub4 len42 = 0;
ub4 type42 = 0;
ub4 len43 = 0;
ub4 type43 = 0;
ub4 len44 = 0;
ub4 type44 = 0;
ub4 len45 = 0;
ub4 type45 = 0;
ub4 len46 = 0;
ub4 type46 = 0;
ub4 len47 = 0;
ub4 type47 = 0;
ub4 len48 = 0;
ub4 type48 = 0;
ub4 len49 = 0;
ub4 type49 = 0;
ub4 len50 = 0;
ub4 type50 = 0;
ub4 len51 = 0;
ub4 type51 = 0;
ub4 len52 = 0;
ub4 type52 = 0;
ub4 len53 = 0;
ub4 type53 = 0;
ub4 len54 = 0;
ub4 type54 = 0;
ub4 len55 = 0;
ub4 type55 = 0;
ub4 len56 = 0;
ub4 type56 = 0;
ub4 len57 = 0;
ub4 type57 = 0;
ub4 len58 = 0;
ub4 type58 = 0;
ub4 len59 = 0;
ub4 type59 = 0;
ub4 len60 = 0;
ub4 type60 = 0;
ub4 len61 = 0;
ub4 type61 = 0;
ub4 len62 = 0;
ub4 type62 = 0;
ub4 len63 = 0;
ub4 type63 = 0;
ub4 len64 = 0;
ub4 type64 = 0;
ub4 len65 = 0;
ub4 type65 = 0;
ub4 len66 = 0;
ub4 type66 = 0;
ub4 len67 = 0;
ub4 type67 = 0;
ub4 len68 = 0;
ub4 type68 = 0;
ub4 len69 = 0;
ub4 type69 = 0;
ub4 len70 = 0;
ub4 type70 = 0;
ub4 len71 = 0;
ub4 type71 = 0;
ub4 len72 = 0;
ub4 type72 = 0;
ub4 len73 = 0;
ub4 type73 = 0;
ub4 len74 = 0;
ub4 type74 = 0;
ub4 len75 = 0;
ub4 type75 = 0;
ub4 len76 = 0;
ub4 type76 = 0;
ub4 len77 = 0;
ub4 type77 = 0;
ub4 len78 = 0;
ub4 type78 = 0;
ub4 len79 = 0;
ub4 type79 = 0;
ub4 len80 = 0;
ub4 type80 = 0;
ub4 len81 = 0;
ub4 type81 = 0;
ub4 len82 = 0;
ub4 type82 = 0;
ub4 len83 = 0;
ub4 type83 = 0;
ub4 len84 = 0;
ub4 type84 = 0;
ub4 len85 = 0;
ub4 type85 = 0;
ub4 len86 = 0;
ub4 type86 = 0
相關推薦
    问

    碎星旗下的主播都有誰

    发布时间：2024-11-11
    有青莲忘川、花泽、三月妖孽等人简介：杭州碎星网络科技有限公司成立于2017-05-11，法定代表人为何义超，注册资本为100万元人民币，统一社会信用代码为91330106MA28RR5X0L，企业地址位于浙江省杭州市拱墅区莫干山路116
    问

    廣西高中語文書是哪個版的

    发布时间：2024-11-11
    人教版，广西高中语文书全都是人教版的，以上广西的高中识本不统一，各地有各地的版本，有人教版也有沪教版，现在统一使用人教版的了。
    问

    簡短好聽的情侶名

    发布时间：2024-11-11
    1、微微一笑很倾城 、 奈何桥边笑奈何。2、橘子味儿的猫 、 草莓味儿的狗。3、稚于最初 、 安于情长。4、七年凉城空浮生 、 三年空城已离殇。5、生物毁了我的清白 、 数学毁了我的未来。6、沐北清歌寒 、 沐南伊人舞
    问

    東北鰲蝦怎麼養

    发布时间：2024-11-11
    1、注意密度饲养鳌虾之前，首先要选择好虾缸，并计划好饲养的密度，以及是否混养其它的观赏虾类。鳌虾是比较具有攻击性的观赏虾，鳌虾有较强的领地意识，若是不想要自己养的鳌虾经常打架受伤的话，最好减小饲养密度。2、缸内造景建立一个良好的生
    问

    華圖所謂的面試基地班靠譜嗎

    发布时间：2024-11-11
    华图的面试基地班靠谱。面试基地班一般是以封闭的形式去培训，这样可以保证学习效果以及更有针对性，上岸率也非常高，而且报名之前会签协议，面试通过协议生效，没有通过是可以退费的。而且基地班的老师都是优中选优的，是华图最好的老师可以放心。
    问

    女孩經常喝奶茶的危害

    发布时间：2024-11-11
    1、女生经常喝奶茶容易导致摄入了过多的糖分和蛋白质，堵塞了毛孔，引发痤疮。2、奶茶它主要是一种奶制品，里边添加了少量的茶叶成分，经常喝会导致体内血糖升高，引发糖尿病，并且这个糖分在体内堆积又不容易排出，容易形成肥胖的现象。并且奶茶都是
    问

    15款邁騰大燈原廠什麼品牌

    发布时间：2024-11-11
    15款大众迈腾第一代车型的大灯品牌为Hella。Hella是全球知名的照明与电子技术领域的企业,其产品涉及汽车、物流和工业等多个领域。Hella的汽车灯具以高品质、高性能和高稳定性著称。因此,选择Hella成为大众迈腾第一代车型的大灯品牌
    问

    孕婦能喝玫瑰花茶嗎

    发布时间：2024-11-11
    孕妇一般是要注意饮食，尤其是药物更应该注意，玫瑰花，是可以活血化瘀疏肝。对于临床上女性月经期月经不调，腹疼，痛经等有很好作用，还可以治疗肝气郁结导致的心情不好，烦躁易怒，还有一定美容作用，所以在孕期是不能服用的，一定要注意。
    问

    更年期滋陰的食物

    发布时间：2024-11-11
    1、何首乌：何首乌是滋阴补肾第一品。也是被当做医家第一的保健品。女性有筋骨酸痛，早衰等问题，都可以通过服用何首乌起到一定很好的改善作用。2、枸杞子：枸杞子性平味甘，具有清心明目养肝的功效，其实枸杞子也是滋阴补肾的最好选择之一。尤其对于
    问

    王者榮耀雲中君專精裝備

    发布时间：2024-11-11
    巨人之握+抵抗之靴+暗影战斧+无尽战刃+破军+破甲弓出装思路首先打野刀出门，升到二级巨人之握即可。再来是鞋子，大家可以根据情况出装，抵抗之靴、影刃之足和疾步之靴都是可以的，影刃之足加强生存能力，疾步之靴gank效率更高。再来是暗影战斧

Copyright © 2020-2024，Powered By 答答問 滇ICP备2020007400号-21