wiki-The stack usage for tail-recursive functions is bounded by a constant (i.e., is O(1)). plz explain how O(1)??

yes asked Oct 31, 2015

292 views

2 votes

yes asked Oct 31, 2015

yes

292 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

I think there is some base condition before recursive call (as its a tail recursion). So, the stack can not overflow.

monanshi answered Nov 23, 2015

monanshi

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

1 answer

anonymous asked Jun 26, 2016

678 views

some1 plz explain why the time complexity of Prims algorithm using arrays is O(v^2+2E)...thanks in advance

anonymous

678 views

anonymous asked Jun 26, 2016

Algorithms
prims-algorithm
time-complexity

+ –

0 votes

1 answer

_xor_ asked May 29, 2015

434 views

what is the size of stack we need in tail recursion ???

_xor_

434 views

_xor_ asked May 29, 2015

0 votes

1 answer

Piyush Kapoor asked Sep 24, 2015

1,354 views

This is previous year Stack question but i have doubt in infix to postfix conversion .plz tell
Assume that the operators +,−, are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, ,+,−. The postfix expression corresponding to the infix expression a+b c−d^e ... giving ^^ at a time then because of same precedeence I put ^ first ....where am i wrong?

Assume that the operators +,−,× are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^,×,+,−. The postfix expression...

Piyush Kapoor

1.4k views

Piyush Kapoor asked Sep 24, 2015

0 votes

1 answer

Unique_999 asked Sep 3, 2023

295 views

Can anyone explain , in the concept of segmentation . let the base address of a particular segment is 1900 and the limit of the segment is 400(i.e., size limit). Exactly what does it represent at the address 1900. Is it a page or group of pages or words

Unique_999

295 views

Unique_999 asked Sep 3, 2023

Operating System
segmentation
operating-system
virtual-memory
paging

+ –

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

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0