[C] Сортирање

#include <stdio.h>

void swap(int *arr, int i) {
    int temp=*(arr+i);
    *(arr+i)=*(arr+i+1);
    *(arr+i+1)=temp;
}

void sort(int *arr, int n) {
    int i, j, swapped = 0;

    for( i = 0 ; i < n ; i++ )
        for( j = 0 ; j < n-1 ; j++ )
            if(arr[j] > arr[j+1])
                swap(arr, j);
}

void merge(int *arr, int *arr2, int *arrend, int n) {
    int i = 0, j = 0, k = 0, l;

    for( i=0 ; i < n&&j < n ; ) {
        if (arr[i] < arr2[j])
            arrend[k++] = arr[i++];
        else
            arrend[k++] = arr2[j++];
    }

    if (i < n)
        for (l = i; l < n; l++)
            arrend[k++] = arr[l];
    else
        for (l = j; l < n; l++)
            arrend[k++] = arr2[l];
}

int main() {
    int n, i;
    int arr[400], arr2[400], arrend[400];
    scanf("%d", &n);

    for(i = 0; i < n; ++i)
        scanf("%d", &arr[i]);
    for(i = 0; i < n; ++i)
        scanf("%d", &arr2[i]);

    sort(arr, n);
    sort(arr2, n);

    merge(arr, arr2, arrend, n);

    for(i = 0; i < 2 * n; ++i)
        printf("%d ", arrend[i]);

return 0;
}