Prime Number by Recursion

Problem Statement
Write a recursive c program to check weather a number is prime or not


#include<stdio.h>
int isprime(int n,int m);
int main()
{
  int n,m,y;
  m=2;
  printf("enter the number ");
  scanf("%d",&n);
  y= isprime(n,m);
  if(y==1)
    {printf("nnoprime \n");}
  else
    {printf("prime \n");}
  return 0;
}
int isprime(int n,int m)
{
  int res;
  if(m==n)
    { res=0;
      return res;}
  else
    {
      if(n%m==0)
{  res=1;
 return res ;}
      else
{res = isprime(n,m+1);
}
    }

  return res;
}