RecursionError: maximum recursion depth exceeded in comparison Python
2
I'm trying to write a recursive function to print some sort of permutations in python.
However I get maximum depth error for some reason.
def perm(chars, k, word):
if k == 0:
print(word)
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Anyone has any idea what the error is?
python recursion
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
add a comment |
2
I'm trying to write a recursive function to print some sort of permutations in python.
However I get maximum depth error for some reason.
def perm(chars, k, word):
if k == 0:
print(word)
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Anyone has any idea what the error is?
python recursion
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
add a comment |
2
2
2
I'm trying to write a recursive function to print some sort of permutations in python.
However I get maximum depth error for some reason.
def perm(chars, k, word):
if k == 0:
print(word)
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Anyone has any idea what the error is?
python recursion
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
I'm trying to write a recursive function to print some sort of permutations in python.
However I get maximum depth error for some reason.
def perm(chars, k, word):
if k == 0:
print(word)
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Anyone has any idea what the error is?
python recursion
python recursion
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
asked Nov 15 '18 at 18:23
user4464936user4464936
6317
6317
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
6
You're missing a base case, causing your call stack to overflow. Add a base case by making the for loop (the recursive case) conditional:
def perm(chars, k, word):
if k == 0:
print(word)
else:
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Output:
11
21
12
22
Try it!
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
2
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53325713%2frecursionerror-maximum-recursion-depth-exceeded-in-comparison-python%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
6
You're missing a base case, causing your call stack to overflow. Add a base case by making the for loop (the recursive case) conditional:
def perm(chars, k, word):
if k == 0:
print(word)
else:
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Output:
11
21
12
22
Try it!
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
2
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
add a comment |
6
You're missing a base case, causing your call stack to overflow. Add a base case by making the for loop (the recursive case) conditional:
def perm(chars, k, word):
if k == 0:
print(word)
else:
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Output:
11
21
12
22
Try it!
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
2
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
add a comment |
6
6
6
You're missing a base case, causing your call stack to overflow. Add a base case by making the for loop (the recursive case) conditional:
def perm(chars, k, word):
if k == 0:
print(word)
else:
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Output:
11
21
12
22
Try it!
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
You're missing a base case, causing your call stack to overflow. Add a base case by making the for loop (the recursive case) conditional:
def perm(chars, k, word):
if k == 0:
print(word)
else:
for char in chars:
perm(chars, k - 1, char + word)
perm(['1','2'], 2, '')
Output:
11
21
12
22
Try it!
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
edited Nov 15 '18 at 22:18
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
answered Nov 15 '18 at 18:25
ggorlenggorlen
7,6633926
7,6633926
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
2
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
add a comment |
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
2
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
yeah apparently i was just missing that else :)
– user4464936
Nov 15 '18 at 18:27
2
2
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
Just to piggyback- OP, maximum recursion depth is almost always a telltale sign of an infinite loop. A common error that leads to infinite loops is incorrect base cases, as we have seen here
– Hollywood
Nov 15 '18 at 18:28
add a comment |
draft saved
draft discarded
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53325713%2frecursionerror-maximum-recursion-depth-exceeded-in-comparison-python%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
