recursion tag

8 questions


1 answers
324 views
0
I want to make a list of all combinations.

There is a text file with 10,000 words (one new line at a time) consisting of five alphabetic characters.Find out how many 5-character words are in the text file that can be created by rearranging the...

1 years ago

2 answers
61 views
0
How do I speed up the recursive process with Python?

The following are the issues.atcorder270 Problem 3https://atcoder.jp/contests/abc270/tasks/abc270_cAfter submitting it, the test of 10 questions will run out of time.I am currently working on Python a...

1 years ago

1 answers
76 views
0
double recursion

Hi, everyone.In the process of studying double reflexes,I'm asking because I don't understand the following function.I don't quite understand how the function to get the maximum value works, as follow...

1 years ago

1 answers
52 views
0
Python, error putting comb result list using recursion.

It's a situation that's caused by a lack of understanding of recursive functions, but it's not resolved

1 years ago

1 answers
71 views
0
C언어 팩토리얼 재귀함수 구현 시 return 1의 의미가 뭔가요?

#define _CRT_SECURE_NO_WARNIGS#include<stdio.h>#include<stdlib.h>int factorial(int n);int main() { int n; scanf(%d, &n); printf(%d\n, factorial(n)); return 0;}int factorial(int n) { if...


1 answers
68 views
0
Execution of a for statement within a recursive function

import java.util.ArrayList;import java.util.Scanner;public class Anagram {public static void ana(ArrayList<String> ar, ArrayList<String> sub){ if(ar.size()>1) { for(int i = 0; i < a...

1 years ago

1 answers
67 views
0
Python recursive function example question.

building = [Gyeongbokgung, 1395, [Sungnyemun, 1396, [Changdeokgung, 1405]]This building string is Gyeongbokgung Palace 1395 Sungnyemun 1396 Changdeokgung Palace 1405 I'm going to put it this way.By ...

1 years ago

1 answers
73 views
0
Fibonacci sequence recursive function algorithm question.

The Fibonacci sequence has a repetition that the sum of the total number and the total number is the next number, like 11 2 3 5 8 13, which is how this is coded as a recursive functionint Fib(int n){ ...

2 years ago

© 2024 OneMinuteCode. All rights reserved.