c array sort

//
// Created by jia on 19/12/18.
//
#include "../header.h"
//information
void print_label(char* string){
    printf("%s
", string);
}
//oupt array
void arr_output(int n, int arr[]){
    for(int i = 0; i < n; i ++){
        printf("arr[%d] = %4d	", i, arr[i]);
    }

    printf("

");
}
//swap two datas to make sure the first is smaller than the second
void data_swap(int* a, int* b){
    if(*a > *b){
        int temp = *a;
        *a = *b;
        *b = temp;
    }
}

//improved bubble sort
void improvedbubblesort(int n, int arr[]) {
    bool sorted = true;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n - i - 1; j++) {
            data_swap(&arr[j], &arr[j + 1]);
            sorted = false;
        }
    if (sorted) {
        return;
    }
    arr_output(n, arr);
}
//bubble sort
void bubblesort(int n, int arr[]){
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < n - i - 1; j ++){
            data_swap(&arr[j], &arr[j + 1]);
        }
    arr_output(n, arr);
}
//other sort
void othersort(int n, int arr[]){
    for(int i = 0; i < n; i ++)
        for(int j = i; j < n; j ++){
            data_swap(&arr[i], &arr[j]);
        }
    arr_output(n, arr);
}

//insertion sort
void insertionsort(int n, int arr[]){
    for(int i = 0; i < n; i ++){
        int temp = arr[i];
        bool hasmoved = false;
        bool notplaced = true;
        for(int j = i - 1; j >= 0; j --){
            if(arr[j] > temp){
                //shift numvers till you find it's right location
                arr[j + 1] = arr[j];
                hasmoved = true;
            }else{
                arr[j+1] = temp;
                notplaced = false;
                break;
            }
        }
        if(hasmoved && notplaced){
            arr[0] = temp;
        }
    }
    arr_output(n, ARR);
}

void selectionsort(int n, int arr[]){
    for(int j = n -1; j < n; j --){
        int pos = 0;
        for(int i = 1; i <= j; i ++){
            if(arr[i] > arr[pos]){
                pos = i;
            }
            data_swap(&arr[pos], &arr[j]);
        }
    }
    arr_output(n, ARR);
}
void mergesort(int n, int arr[]){

}

//void (*cmc_result)(int n, int arr[]) function pointer to point the function
void getsort(int t, void (*cmc_result)(int n, int arr[])){
    switch(t){
        case 0:{
            print_label("bubble sort:");
            //bubblesort(N, ARR);
            cmc_result(N, ARR);
        } break;
        case 1:{
            print_label("other sort:");
            othersort(N, ARR);
            //cmc_result(N, ARR);

            //cmc_result = othersort;
        } break;
        case 2:{
            print_label("improved sort:");
            cmc_result(N, ARR);
        } break;
        case 3:{
            print_label("insertion sort:");
            cmc_result(N, ARR);
            //cmc_result = othersort;
        } break;
        case 4:{
            print_label("selection sort:");
            cmc_result(N, ARR);
        } break;
    }
}