1. Write a recursive function for OurList of integers that returns the largest v
ID: 3717096 • Letter: 1
Question
1. Write a recursive function for OurList of integers that returns the largest value of them.
2. Write a recursive function for OurList of characters that reverses their order.
3. Modify the program of drawing bullseye (Source Code below) to draw Pyramid. Specify the number of levels and
the overall width (which can be the same as the height). Unlike the outer circle and inner
circle bullseye were concentric, you will need to relocate the bottom rectangle and the upper
pyramid to achieve the desired effect. Move the components so that the completed pyramid
sits in the middle of the canvas (the default reference point).
****Source Code*****
from cs1graphics import *
class Bullseye(Drawable):
"""Represent a bullseye with an arbitrary number of bands."""
def __init__(self, numBands, radius, primary='black',
secondary='white'):
"""Create a bullseye object with alternating colors.
The reference point for the bullseye will be its center.
numBands the number of desired bands (must be at least 1)
radius the total radius for the bullseye (must be positive)
primary the color of the outermost band (default black)
secondary the color of the secondary band (default white)
"""
if numBands <= 0:
raise ValueError('Number of bands must be positive')
if radius <= 0:
raise ValueError('radius must be positive')
Drawable.__init__(self) # must call parent
constructor
self._outer = Circle(radius)
self._outer.setFillColor(primary)
if numBands == 1:
self._rest = None
else: # create new bullseye with one less band, reduced radius, and
inverted colors
innerR = float(radius) * (numBands-1) / numBands
self._rest = Bullseye(numBands-1, innerR, secondary, primary)
def _draw(self):
self._beginDraw() # required protocol
for Drawable
self._outer._draw() # draw the circle
if self._rest:
self._rest._draw() # recursively draw
the rest
self._completeDraw() # required protocol
for Drawable
paper = Canvas(400, 400)
simple = Bullseye(3, 60)
simple.move(65, 80)
paper.add(simple)
blue = Bullseye(10, 120, 'darkblue', 'skyblue')
paper.add(blue)
blue.move(195,120)
Explanation / Answer
1. Finding largest number from a list using recursion
#include <stdio.h>
int large(int[], int, int);
int main()
{
int size;
int largest;
int list[20];
int i;
printf("Enter size of the list:");
scanf("%d", &size);
printf("Printing the list: ");
for (i = 0; i < size ; i++)
{
list[i] = rand() % size;
printf("%d ", list[i]);
}
if (size == 0)
{
printf("Empty list ");
}
else
{
largest = list[0];
largest = large(list, size - 1, largest);
printf(" The largest number in the list is: %d ", largest);
}
}
int large(int list[], int position, int largest)
{
if (position == 0)
return largest;
if (position > 0)
{
if (list[position] > largest)
{
largest = list[position];
}
return large(list, position - 1, largest);
}
}
2. Program to reverse order of a List of characters using recursion
#include <stdio.h>
#include <string.h>
void reverse(char [], int, int);
int main()
{
char str[20];
int size;
printf("Enter a list of characters or string to reverse: ");
scanf("%s", str);
size = strlen(str);
reverse(str, 0, size - 1);
printf("The list of characters after reversing is: %s ", str);
return 0;
}
void reverse(char str[], int index, int size)
{
char temp;
temp = str[index];
str[index] = str[size - index];
str[size - index] = temp;
if (index == size / 2)
{
return;
}
reverse(str, index + 1, size);
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.