Write a program named polygons.py that has two functions for generating convex regular polygons Regular polygon - Wikipedia. One function should be implemented using an iteration (a for loop), and another function should be a recursion. It is optional to fill in your shapes. The functions for generating polygons should be named polygon (size, n) and polygon_recursive(size, n, level) where size is the size of the polygon side (edge), n is the number of sides (or angles), and level is the level of recursion initially equal to n.

Write a program named polygons.py that has two functions for generating convex regular polygons Regular polygon - Wikipedia. One function should be implemented using an iteration (a for loop), and another function should be a recursion. It is optional to fill in your shapes. The functions for generating polygons should be named polygon (size, n) and polygon_recursive(size, n, level) where size is the size of the polygon side (edge), n is the number of sides (or angles), and level is the level of recursion initially equal to n.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

help in pytyhon
Write a program named stars.py that has two functions for generating star polygons. One function should be implemented using an iteration (a for loop), and another function should be a recursion. It is optional to fill in your shapes. The functions for generating stars should be named star (size, n, d=2) and star_recursive (size, n, level, d=2), where size is the size of the polygon side (edge), n is the number of sides (or angles), d is a density or winding number that should be set to default value 2, and level is the level of recursion initially equal to n.
pythn opython
please code in python Write a recursive function to add a positive integer b to another number a, add(a, b), where only the unit 1 can be added, For example add(5, 9) will return 14. The pseudocode is: # Base case: if b is 1, you can just return a + 1 # General case: otherwise, return the sum of 1 and what is returned by adding a and b - 1.
Python programming
Create a function that returns the nth catalan number. In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively-defined objects. They are named after the Belgian mathematician Eugène Charles Catalan (1814-1894). For more info, check out the resource tab. Examples getCatalanNumber (0) → 1 getCatalanNumber (6) → 132 getCatalanNumber (8) 1430 Notes Inputs are zero and positive integers.
write a recursive version. The function takes two string parameters, s1 and s2 and returns the starting index of s2 inside the first string s1, or -1 if s2 is not found in s1. You must not use any loops; you also cannot use the string member functions find or rfind. You may use the member functions size, at and substr. Your function must be recursive.
python
Write factorial1 function in python 3.8 follow the directions provided below, don't need anything else as long as it meets all the requirements below. Function: factorial1 The function implements an iterative factorial. It takes an integer n as argument and returns n! The method needs to be computed interactively (not recursively
In python. Include docstring. Please follow code requirements as listed below. Write a recursive function named is_subsequence that takes two string parameters and returns True if the first string is a subsequence of the second string, but returns False otherwise. We say that string A is a subsequence of string B if you can derive A by deleting zero or more letters from B without changing the order of the remaining letters. The empty string (which has zero characters) is considered a subsequence of any string (since you can derive it by deleting zero or more letters from any string). You can assume that the only characters in the strings will be lower case letters (though that shouldn't really affect your code). Note: subsequences are different than substrings, since the characters of a subsequence don't have to be consecutive. For example, 'aeiou' is a subsequence of 'faceitious', since all the characters appear in the same order, even though they're not consecutive. You may use…
Write a recursive function named largestDigit that accepts an integer parameter and returns the largest digit value that appears in that integer. Your function should work for both positive and negative numbers. If a number contains only a single digit, that digit's value is by definition the largest. You must not use any loops; you also cannot use the string type or any library functions. Your function must be recursive. Complete the following file: largestDigit.cpp 2 // You may use this helper function 3 int max(int a, int b) { return a < b ? b : a; } 4 5 int largestDigit(int n) if((n<0) && (n/10 if(n<0) n = 0)) return n; 8 -n; static int maxi 9 n%10; 0) return maxi; maxi = max(maxi, n%10); return largestDigit(n/10); = 10 if((n/10) 11 12 13 14 15 16 } Submit Calling with Arguments Name Arguments Actual Expected pass largestDigit 135725 7 7 pass largestDigit 111211 2 2 fail largestDigit 100000 1 pass largestDigit 4530021 5 pass largestDigit 7639852 fail largestDigit 76352 6 pass…
Submission: Submit python code Problem: If n is a positive integer, then n factorial (written n!) is the product of the numbers from 1 through n. Write a recursive function to calculate n factorial. Hints: n! = (n – 1) · (n– 2) 2: 1 As written, n! can be calculated iteratively with a for loop-however, when rewritten as n! = n · ((n – 1) · (n – 2) 3 · 2 · 1) = n · (n – 1)! n! is expressed in terms of (n – 1)! and can be calculated recursively with n = 1 as the base case. | Example input and output: >>> factorial(5) 120 >>>