Recursion minimum array; array recursion average

Recursive evaluation of the average value of the array 
#include <, iostream.h> 
int A [10] = {6,2,7,3}; 
a float AVG (n-int) // n-representative of the number of elements 
{ 
   IF (n-==. 1) 
	   a return [0]; 
   return (a [n--. 1] + AVG (n--. 1) * (n--. 1)) / n-; 
} 
// a recursive call (here, avg (n-1)) is quite in a loop 
void main () 
{ 
	int n-; 
	CIN n->>; 
    COUT << AVG (n-);	  
} 
///////////////////////// ///// 
recursion array minimum 
#include <, iostream.h> 
int A [10] = {6,4,7,3}; 
int min (n-int) // n-representative of the number of elements 
{ 
	int m; 
   IF (n-==. 1) 
	   return A [0]; 
   m = min (. 1-n-); 
   IF (m> A [n--. 1]) 
	   m = A [n--. 1]; 
   return m; 
	   
}
// a recursive call (here min (n-1)) is equivalent to a circular 
void main () 
{ 
	int n-; 
	CIN n->>; 
    COUT << min (n-);	  
}