Binary tree sorting (C language, int type)

#define _CRT_SECURE_NO_WARNINGS   // Binary tree sorting （int type ）
#include<stdio.h>                 // Array index from 1 Start 
#include <string.h>

void move_int(int a[], int a_length) {      // Will array a Move the whole backward by one bit , Give Way a[0] invalid 
	for (int i = a_length; i > 0; i--) {
		a[i] = a[i - 1];
	}
}

void exch_int(int a[], int i, int j) {	// In exchange for a[i] and a[j] Value 
	int temp;
	temp = a[i];
	a[i] = a[j];
	a[j] = temp;
}

void swim_int(int a[], int k) {	// Floating up k The element of location   To the right place （ The tree is descending from top to bottom ）
	while (k > 1 && a[k / 2] < a[k]) {
		exch_int(a, k / 2, k);
		k = k / 2;
	}
}

void sink_int(int a[], int k, int a_length) {	// Sinking k Location elements , Give priority to exchanging positions with the largest left and right children （ The tree is descending from top to bottom ）
	while (2 * k <= a_length) {                 //a_length Is an array a Remove a[0] The length after 
		int j = 2 * k;
		if (j < a_length && a[j] < a[j + 1]) j++;
		if (!(a[k] < a[j])) break;
		exch_int(a, k, j);
		k = j;
	}
}

void BiTree_sort_int(int a[], int a_length) {	// Binary tree sorting ,a_length Is an array a The effective length of minus 1（ I.e. removal a[0] The length after )
	for (int k = a_length / 2; k >= 1; k--) {	// Make the binary tree orderly （ Descending from top to bottom ）
		sink_int(a, k, a_length);
	}

	while (a_length > 1) {		// Sort ascending from top to bottom 
		exch_int(a, 1, a_length--);
		sink_int(a, 1, a_length);
	}
}

int main() {
	int a[100] = {};

	printf(" Please enter the total number of numbers ：\n");		
	int N;
	scanf("%d", &N);

	printf("\n Please enter %d Number ：\n", N);
	for (int i = 0; i < N; i++) {
		scanf("%d", &a[i]);
	}
	move_int(a, N);            //a[0] Give up not to use ！！

	BiTree_sort_int(a, N);

	printf("\n The result after ascending is ：\n");
	for (int i = 1; i <= N; i++) {
		printf("%d ", a[i]);
	}
	printf("\n");
	return 0;
}

test result ：