Pure C language: half find source sharing

#include <stdio.h>     
  int bin_search(int key[],int low, int high,int k)    
  {    
    int mid;    
    if(low>high)
    {
       return -1;    
    }
    else  
     {    
         mid = (low+high) / 2;    
         if(key[mid]==k)    
             return mid;    
         if(k>key[mid])    
             return bin_search(key,mid+1,high,k);            
         else    
             return bin_search(key,low,mid-1,k);                
      }    
 }    

 int main()    
 {    
     int n , i , addr;    
     int A[10] = {2,3,5,7,8,10,12,15,19,21};    
      printf("The contents of the Array A[10] aren");    
      for(i=0;i<10;i++)  
         printf("%d ",A[i]);                                    
      printf("nPlease input a interger for searchn");    
      scanf("%d",&n);                                    
      addr = bin_search(A,0,9,n);    
      if(-1 != addr)        
 {
         printf("%d is at the %dth unit is array An ",n,addr);    
 }
      else
 {
  printf("There is no %d in array An",n);                
 }
  getchar();    
  return 0;    
  }