以下是使用C语言和模块化方法实现数组的四个基本操作的示例代码:

  1. 排序操作
#include <stdio.h>

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

int main() {
    int arr[] = {5, 3, 1, 4, 2};
    int n = sizeof(arr) / sizeof(arr[0]);
    sort(arr, n);
    printf("Sorted array: ");
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}
  1. 查找操作
#include <stdio.h>

int search(int arr[], int n, int x) {
    int i;
    for (i = 0; i < n; i++) {
        if (arr[i] == x) {
            return i;
        }
    }
    return -1;
}

int main() {
    int arr[] = {5, 3, 1, 4, 2};
    int n = sizeof(arr) / sizeof(arr[0]);
    int x = 4;
    int index = search(arr, n, x);
    if (index != -1) {
        printf("%d is found at index %d\n", x, index);
    } else {
        printf("%d is not found in the array\n", x);
    }
    return 0;
}
  1. 插入操作
#include <stdio.h>

void insert(int arr[], int n, int x, int pos) {
    int i;
    for (i = n - 1; i >= pos; i--) {
        arr[i + 1] = arr[i];
    }
    arr[pos] = x;
}

int main() {
    int arr[10] = {5, 3, 1, 4, 2};
    int n = 5;
    int x = 6;
    int pos = 2;
    insert(arr, n, x, pos);
    printf("Array after insertion: ");
    for (int i = 0; i < n + 1; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}
  1. 删除操作
#include <stdio.h>

void delete(int arr[], int n, int pos) {
    int i;
    for (i = pos; i < n - 1; i++) {
        arr[i] = arr[i + 1];
    }
}

int main() {
    int arr[] = {5, 3, 1, 4, 2};
    int n = sizeof(arr) / sizeof(arr[0]);
    int pos = 2;
    delete(arr, n, pos);
    printf("Array after deletion: ");
    for (int i = 0; i < n - 1; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
    return 0;
}
``
用C语言写用模块化方法实现数组的四个基本操作:排序、查找、插入和删除

原文地址: https://www.cveoy.top/t/topic/fRRq 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录