For questions involving recursive functions, or functions or programs calling itself, directly or indirectly.
13
votes
6answers
211 views
Prefix Tree Traversal
Write a program that takes in (via stdin or command line) a string with the recursive form
PREFIX[SUFFIXES]
where
PREFIX may be any string of lowercase letters (a-z), including the empty string, ...
25
votes
10answers
818 views
Print, Increment, Decrement, Alias - Interpret Prindeal
Prindeal (pronounced prin-dee-al) is a new esoteric programming language that only has four commands: print, increment, decrement, and alias. Despite its minimalism, complex mathematical operations ...
18
votes
12answers
1k views
Evaluating Parentheses and Brackets as Integers
Write a program that takes in a string of the four characters ()[] that satisfies these points:
Every left parenthesis ( has a matching right parenthesis ).
Every left bracket [ has a matching right ...
7
votes
8answers
874 views
Ways to arrange the integers 1 to 9 with operators so that the result is 100
Prelude:
This task is taken from Five Problems Every Software Engineer Should Be Able to Solve in Less Than an Hour, which I really recommend.
The task:
Write a program that outputs all ...
5
votes
2answers
731 views
Coding a recursive function for highest possible input
Challenge
You are given the following function:- which is the same as:-
with the base cases q(r, b, L) = 1 whenever r ≤ L, q(r, 0, L) = 0, if r > L and q(r, 0, L) = 1, if r ≤ L.
Your task is to ...
15
votes
18answers
4k views
The Ackermann function
The Ackermann function is notable for being the one of the simplest examples of a total, computable function that isn't primitive recursive.
We will use the definition of A(m,n) taking in two ...
