Find a recurrence relation that represents the following recursive function: int rec(int n) ( if(n <...

  

Transcribed Image Text:

Find a recurrence relation that represents the following recursive function: int rec(int n) ( if(n < 2) return 1; else 1 1 int sum; for(int i = 1;i<n;i++) sum + =i; return sum rec(n/2); return 1; else 1 1 int sum; for(int i = 1,i<n;i++) sum + =i; return sum^rec(n/2); Find a recurrence relation that represents the following recursive function: int rec(int n) ( if(n < 2) return 1; else 1 1 int sum; for(int i = 1;i<n;i++) sum + =i; return sum rec(n/2); return 1; else 1 1 int sum; for(int i = 1,i<n;i++) sum + =i; return sum^rec(n/2);

Answer rating: 100% (QA)

Recn ... View the full answer