[C language] three sorting methods for random number files

General content ： Generate a random number file , And load it into the heap , Bubble it , Insert , Selection sort , Quick sort please go to my blog to find .
The three sorting ideas will not be repeated , It's also very simple to implement , Here directly on the code ！

 Compile environment ：Ubuntu18.04		GCC && CLion

---

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define max 200


// Random number file creation , contain max It's worth 
void creatValue() {
    
    FILE *file = fopen("./value.txt", "w");
    if (!file)
        return;

    // Random number seed import 
    srand((unsigned) time(NULL));
    int arr[max] = {
    0};

    // write file 
    for (int i = 0; i < max; ++i) {
    
        arr[i] = rand() % 300;
        fprintf(file, "%d\n", arr[i]);
    }

    printf(" Create success \n");
    fclose(file);
}


// Exchange function 
void swapValue(int *value1, int *value2) {
    
    int temp = *value1;
    *value1 = *value2;
    *value2 = temp;
}


// Import the random number file into the heap 
int *importValue() {
    
    FILE *file = fopen("./value.txt", "r");
    if (!file)
        return NULL;

    // Open up heap space of corresponding size 
    int *arr = (int *) malloc(sizeof(int) * max);

    // Import into heap 
    for (int i = 0; i < max; ++i) {
    
        fscanf(file, "%d\n", &arr[i]);
    }

    return arr;
}


// Print function , Ten in a row 
void printValue(int *arr) {
    
    for (int i = 0; i < max; ++i) {
    
        printf("%d\t", *(arr + i));
        if (!((i + 1) % 10))
            printf("\n");
    }
    printf("\n");
}


// Bubble sort 
void bubbleSort(int *arr) {
    
    for (int i = 0; i < max - 1; ++i) {
    
        for (int j = 0; j < max - 1 - i; ++j) {
    
            if (arr[j] > arr[j + 1]) {
    
                swapValue(&arr[j], &arr[j + 1]);
            }
        }
    }
}


// Selection sort 
void selectionSort(int *arr) {
    
    for (int i = 0; i < max - 1; ++i) {
    
        int temp = i;
        for (int j = i + 1; j < max; ++j) {
    
            if (arr[j] < arr[temp])
                temp = j;
        }
        swapValue(&arr[i], &arr[temp]);
    }
}


// Insertion sort 
void insertionSort(int *arr) {
    
    for (int i = 1; i < max; i++) {
    
        int temp = arr[i];
        int j;

        for (j = i; j > 0 && arr[j - 1] > temp; j--) {
    
            arr[j] = arr[j - 1];
        }
        arr[j] = temp;
    }
}


void test01() {
    
    //creatValue();
    int *p = importValue();

    // Before ordering 
    printValue(p);
    printf("--------------------------------------\n");

    // After ordering 
    //bubbleSort(p);

    //selectionSort(p);
    //insertionSort(p);

    printValue(p);
    //printf("%p\n", p);
}


int main() {
    
    test01();
    return EXIT_SUCCESS;
}

---

Post run screenshot ：