Rod Cutting Problem

int rod_cut(int price[], int n)
{
  if(n== 0)
  return 0;
  int profit = INT_MIN;
  for(int i = 1; i <= n; i++)
  {
    int cost= price[i-1] + rod_cut(price, n-i);
    profit=max(cost, profit);
  }
  return profit;
}