+1 vote
in Data Structures & Algorithms I by (110k points)
What is the definition for Ackermann’s function?

(a) A(1,i) = i+1 for i>=1

(b) A(i,j) = i+j for i>=j

(c) A(i,j) = i+j for i = j

(d) A(1,i) = i+1 for i<1

The query is from Trees in section Trees of Data Structures & Algorithms I

This question was addressed to me during an online interview.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Correct option is (a) A(1,i) = i+1 for i>=1

Easy explanation - The Ackermann’s function is defined as A(1,i) = i+1 for i>=1. This form in text grows faster and the inverse is slower.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.