The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
52 views

asked in Programming by Junior (637 points) | 52 views
0
$-2$??
0
yes -2 should be ans.
0
yes
0
-2 answer
0
plz, show the recursive steps for the above problem.

1 Answer

0 votes
call(p,5)=call(s,5)$\rightleftharpoons$max[call(s+1,4),-2] $\rightleftharpoons $min[call(s+2,3),+3]$\rightleftharpoons $max[call(s+3,2),-3]$\rightleftharpoons $min[call(s+4,1),4]$\rightleftharpoons $ 0
answered by Junior (819 points)

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,783 questions
54,511 answers
188,329 comments
75,112 users