Kurssisisältö

Python Functions Tutorial

1. What is a Function in Python?

What Is Function?Challenge: Building Functions Arguments Return Value Function Body Built-in Functions

2. Positional and Optional Arguments

Positional Arguments Challenge: Positional Arguments Optional Arguments Challenge: Optional Arguments

3. Arbitrary Arguments

Arbitrary Arguments Arbitrary Keyword Arguments Combination of Positional and Optional Arguments

4. Function Return Value Specification

Single Return Value Multiple Return Values None Return Value Generator Functions Challenge: Automated Bus Announcements

5. Recursion and Lambda Functions

Recursion Challenge: Recursive File Search Lambda Functions Immediately Invoked Lambda Expression Writing Effective and Maintainable Functions

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.

Tehtävä

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.

Ratkaisu

Vaihda työpöytään todellista harjoitusta vartenJatka siitä, missä olet käyttämällä jotakin alla olevista vaihtoehdoista

Oliko kaikki selvää?

Kiitos palautteestasi!

Osio 5. Luku 1

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.

Tehtävä

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.

Ratkaisu

Vaihda työpöytään todellista harjoitusta vartenJatka siitä, missä olet käyttämällä jotakin alla olevista vaihtoehdoista

Oliko kaikki selvää?

Kiitos palautteestasi!

Osio 5. Luku 1

Vaihda työpöytään todellista harjoitusta vartenJatka siitä, missä olet käyttämällä jotakin alla olevista vaihtoehdoista