PYTHON PLEASE Write a function that finds the smallest element in a list of float values using the following header: def min(listNum):

C++ The binary search algorithm given in this chapter is nonrecursive. Write and implement a recursive version of the binary search algorithm. The program should prompt Y / y to continue searching and N / n to discontinue. If an item is found in the list display the following message: x found at position y else: x is not in the list Use the following list of integers when testing your program: 2, 6, 8, 13, 25, 33, 39, 42, 53, 58, 61, 68, 71, 84, 97

use c++ Programming language  Write a program that creates a two dimensional array initialized with test data.  Use any data type you wish .  The program should have following functions: .getAverage: This function should accept a two dimensional array as its argument and return the average of each row (each student have their average) and each column (class test average) all the values in the array. .getRowTotal: This function should accept a two dimensional array as its first argument and an integer as its second argument.  The second argument should be the subscript of a row in the array. The function should return the total of the values in the specified row. .getColumnTotal:  This function should accept a two dimensional array as its first argument and an integer as its second argument.  The second argument should be the subscript of a column in the array. The function should return the total of the values in the specified column. .getHighestInRow: This function should accept a two…

Probelm part 1:  Define a function called common_divisors that takes two positive integers m and n as its arguments and returns the list of all common divisors (including 1) of the two integers, unless 1 is the only common divisor. If 1 is the only common divisor, the function should print a statement indicating the two numbers are relatively prime. Otherwise, the function prints the number of common divisors and the list of common divisors. Complete each to do with comments to expalin your process.  Problem part 2: complete the following todo's and make comments to explain each step  # TODO: Define the function 'common_divisors' with two arguments 'm' and 'n'.     # TODO: Start with an empty list and append common divisors to the list.         # TODO: Create a conditional statement to print the appropriate statement as indicated above.   Problem part 3: Call the function common_divisors by passing 5 and 38. Your output should look like this: 5 and 38 are relatively prime. # TODO: Call…

language = python

language = python