Heap structure and heap sort heapify

Heap structure and heap sorting heapify

Recommended by friends , stay b Stand and watch the order of the lanterns on the first lunar month . I think it's good . Subtotal summary .
Pile up heap：
The structure of the heap is a complete binary tree ：
From top to bottom , From left to right . The parent node value > Child node ;
heapify（ Form a heap structure sort ）: The parent node exchanges with the largest child node , Form a heap structure ; from h-1 layer （ Next to last ）
Logical formulas represent ：
int arr[] = {10,5,8,3…};
node ：i=3;
P=(i-1)/2;
c1=2i+1;
c2=2i+2;
Code ：

    // Array swapping ;
    void swap(int arr[],int i,int j){
    
		int temp=arr[i];
		arr[i]=arr[j];
		arr[j]=temp;
	}
	// From the top down heapify（ Form a heap structure sort ）;
	void heapify(int tree[],int n,int i){
    
		if(i>=n){
    
			return;
		}
		int c1=2*i+1;
		int c2=2*i+2;
		int max=i;
		if(c1<n&&tree[c1]>tree[max]){
    
			max=c1
		}
		if(c2<n&&tree[c2]>tree[max]){
    
			max=c2
		}
		if(max!=i){
    
			swap(tree,max,i);
			heapify(tree,n,max);
		}
	}
	// Build heap from bottom to top ;
	void build_heap(){
    
		int last_node=n-1;
		int parent=(last_node-1)/2;
		int i;
		for(i=parent;i>=0;i--){
    
			heapify(tree,n,i);
		}
	}
	// From small to large ;
	void heap_sort(int tree[], int n){
    
		build_heap(tree,n);
		int i;
		for(i=n-1;i>=0;i--){
    
			swap(tree,i,0);
			heapify(tree,i,0);
		}
	}
	int main(){
    
		int tree[]={
    4,10,3,5,1,2};
		int n=6;
		heapify(tree,n,0);
		int i;
		for(i=0;i<n;i++;){
    
			System.out.print(tree[i]);
		}
		return 0;
	}

Like the great God of the first month or friends who see here , Just give praise and attention .thx！
If it helps you , Please pay attention to , give the thumbs-up , Collection , Three even .
Your affirmation , It's my motivation . I wish the Chinese nation an early rejuvenation ！ Thank you. .
؏؏ᖗ A kind of ◡ A kind of ᖘ؏؏