Answer:
Following are the program in the Python Programming Language.
#define function
def Transfer(S, T):
#set for loop
for i in range(len(S)):
#append in the list
T.append(S.pop())
#return the value of the list
return T
#set list type variable
S = ["a","b","c","d"]
#print the values of the list
print(S)
#set the list empty type variable
T=[]
#call the function
T = Transfer(S, T)
#print the value of T
print(T)
<u>Output:</u>
['a', 'b', 'c', 'd']
['d', 'c', 'b', 'a']
Explanation:
Here, we define the function "Transfer()" in which we pass two list type arguments "S" and "T".
- Set the for loop to append the values in the list.
- Then, we append the value of the variable "S" in the variable "T".
- Return the value of the list variable "T" and close the function.
- Then, set the list data type variable "S" and initialize the elements in it and print that variable.
- Finally, we set the empty list type variable "T" and store the return value of the function "Transfer()" in the variable "T" then, print the value of the variable "T".
Answer:publication, telecommunications companies, movie studios, television networks
Explanation:
Just answered it on edg
Answer:
it stores the largest value in list (the maximum) in foo
Explanation:
Initially foo is assigned as the first element of the list
Inside the loop, every element in the list will be compared with foo, starting from the second element. If an element is greater than foo, the new value of the foo will be that element. At the end of the loop, foo will be equal to the largest element in the list.
Ctrl - and ctrl + i hope that is good for you
Answer:
#include <stdio.h>
int fib(int n) {
if (n <= 0) {
return 0;
}
if (n <= 2) {
return 1;
}
return fib(n-1) + fib(n-2);
}
int main(void) {
for(int nr=0; nr<=20; nr++)
printf("Fibonacci %d is %d\n", nr, fib(nr) );
return 0;
}
Explanation:
The code is a literal translation of the definition using a recursive function.
The recursive function is not per se a very efficient one.
