Coin change problem by recursion

#include<iostream>
using namespace std;

int Count(int arr[],int n,int value){
  if(value==0)
    return 1;
  if(value<0)
    return 0;
  if(n<=0)
    return 0;
  return Count(arr,n,value-arr[n-1])+Count(arr,n-1,value);
  }

int main(){
  int arr[] = {1,2,3};
  int m = sizeof(arr)/sizeof(arr[0]);
  cout<< Count(arr, m, 4);
  return 0;
  }