Scorri per mostrare il menu

Recursion

Recursion in Python is when a function calls itself. It's a useful technique for solving complex problems by breaking them down into smaller parts. The key elements of recursion are the base case (the termination condition) and the recursive case (where the function calls itself).


              1234567
            
def print_message(message, times):
    if times > 0:
        print(message)
        print_message(message, times - 1)

# Function call
print_message("Hello, Recursion!", 3)

Let's go step by step through how this recursive program works:

Condition Check: if times > 0, the function proceeds. In this case, times = 3, so the condition is true;
Print Message: the function prints "Hello, Recursion!";
Recursive Call: the function calls itself with times - 1;
Repetition: this process continues until times equals 0;
Termination: when the condition times > 0 is no longer true, the recursion stops, and the program completes.

Result: The message "Hello, Recursion!" is printed three times.

Compito

Swipe to start coding

Given a string representing a phone number, which may contain spaces, dashes, parentheses, or other non-numeric characters. The goal is to extract only the digits using recursion.

If the input string number is empty, return an empty string.
Check if the first character of the string number is a digit using the isdigit() method in an if condition.
If it is a digit, concatenate it with the result of a recursive call to format_phone_number, passing the substring starting from the second character.
If it is not a digit, make a recursive call to format_phone_number, skipping the first character.

Soluzione

Cambia al desktop per esercitarti nel mondo realeContinua da dove ti trovi utilizzando una delle opzioni seguenti

Tutto è chiaro?

Grazie per i tuoi commenti!

Sezione 5. Capitolo 1

Chieda ad AI

Chieda pure quello che desidera o provi una delle domande suggerite per iniziare la nostra conversazione

Recursion


              1234567
            
def print_message(message, times):
    if times > 0:
        print(message)
        print_message(message, times - 1)

# Function call
print_message("Hello, Recursion!", 3)

Let's go step by step through how this recursive program works:

Condition Check: if times > 0, the function proceeds. In this case, times = 3, so the condition is true;
Print Message: the function prints "Hello, Recursion!";
Recursive Call: the function calls itself with times - 1;
Repetition: this process continues until times equals 0;
Termination: when the condition times > 0 is no longer true, the recursion stops, and the program completes.

Result: The message "Hello, Recursion!" is printed three times.

Compito

Swipe to start coding

If the input string number is empty, return an empty string.
Check if the first character of the string number is a digit using the isdigit() method in an if condition.
If it is a digit, concatenate it with the result of a recursive call to format_phone_number, passing the substring starting from the second character.
If it is not a digit, make a recursive call to format_phone_number, skipping the first character.

Soluzione

Cambia al desktop per esercitarti nel mondo realeContinua da dove ti trovi utilizzando una delle opzioni seguenti

Tutto è chiaro?

Grazie per i tuoi commenti!

Sezione 5. Capitolo 1

Cambia al desktop per esercitarti nel mondo realeContinua da dove ti trovi utilizzando una delle opzioni seguenti