Please explain this code for coin change

Question

// Recursive C program for
// coin change problem.
#include<stdio.h>

// Returns the count of ways we can
// sum S[0...m-1] coins to get sum n
int count( int S[], int m, int n )
{
// If n is 0 then there is 1 solution
// (do not include any coin)
if (n == 0)
return 1;

// If n is less than 0 then no
// solution exists
if (n < 0)
return 0;

// If there are no coins and n
// is greater than 0, then no
// solution exist
if (m <=0 && n >= 1)
return 0;

// count is sum of solutions (i)
// including S[m-1] (ii) excluding S[m-1]
return count( S, m - 1, n ) + count( S, m, n-S[m-1] );
}

// Driver program to test above function
int main()
{
int i, j;
int arr[] = {1, 2, 3};
int m = sizeof(arr)/sizeof(arr[0]);
printf("%d ", count(arr, m, 4));
getchar();
return 0;
}

//from geeks for geeks
//please explain how this statement leads to counting coins

Answer 1

Hey Mr. Martin Taylor, I'm not a CS student and when you say classical example, you are damn a CS guy!
But I have seen it for the first time and I'm confused, A live explanation on sololearn speaks a lot for my understanding rather than a dumb online database

By the way I'm not as deaf as you in learning dear martin

Answer 2

Eyes which can look into profiles can't look into the challenges completed successfully
10+ challenges attempted today, Not you, It's me!
What a blind man you are dear Martin Taylor
Hey just a second is there any rule I should complete course and practice the same on the same platform!!?

Answer 3

Dear kiibo
https://code.sololearn.com/c9zD5NOTy7Jq/#c