Insert sort

#include <stdio.h>

int main(void) {
    int j = 0;
    int temp = 0;
    int numbers[] = {0, 0, 0, 0, 0, 1, 5, 4, 2, 3, 0, 5, 6, 7, 8, 9, 10};
    
    int size = sizeof(numbers) / sizeof(int);
    
    for (int i = 1; i < size; i++) {
        int key = numbers[i];
        
        for (j = i - 1; j >= 0; j--) {
            if (numbers[j] < key) {
                numbers[j + 1] = numbers[j];
            } else {
                break;
            }
        }
        
        numbers[j + 1] = key;
    }
    
    for (int i = 0; i < size; i++) {
        printf("%d ", numbers[i]);
    }
    
    return 0;
}