Converting max heap to min heap

#include <bits/stdc++.h> 
vector<int>MinToMaxHeap(int n, vector<int>&arr)
{
	// Write your code here.
	int ind = n / 2 - 1 ; 
	for(int i = ind ; i >= 0 ; i--)
	{
		// int parent = arr[i] ;
		// int child1 = arr[ 2*  i + 1] ; 
		// int child2 = arr[2 * i + 2] ; 
		if( 2* i + 1 < n && arr[ 2*  i + 1]> arr[i])
		{
			swap(arr[i] ,arr[ 2*  i + 1] ) ; 

		}
		if(2* i + 2 < n && arr[2 * i + 2]  > arr[i])
		{
			swap(arr[i] ,arr[ 2*  i + 2] ); 
		}
	}
	return arr ; 
}