sort

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

void sortirovka(int *arr, int a){
    int element, i, index;
    for(i = 1; i < a; i++){
        element = *(arr + i);
        index = i - 1;
        while(index >= 0 && *(arr + index)< element){
            *(arr + index + 1) = *(arr + index);
            *(arr + index) = element;
            index--;
        }
    }
}

int main()
{
    int i, size, *arr;
    printf("please enter the size of array\n");
    scanf("%d", &size);
    arr = (int*)malloc(size * sizeof(int));
    for(i = 0; i < size; i++){
        scanf("%d", &arr[i]);
    }
    sortirovka(arr, size);
    for(i = 0; i < size; i++){
        printf("%d ", arr[i]);
    }
    free(arr);
    return 0;
}