Generate the code for a recursive function: closest(n: int, 1st: list)--> int The function returns the value of the element in the list that is closest in value to, but not greater than the target number n. The code should work for any list of integers with a length greater than or equal to 1. See sample test results below: Function Call: Returns: 3 closest (5, [1, 3, 6, 9, 22]) closest (15, [22, 9, 16, 3, 1]) |c1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 341) closest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55]) closest (-10, [-5, -61, -21, -17, 16]) 9 -5 -17

Generate the code for a recursive function: closest(n: int, 1st: list)--> int The function returns the value of the element in the list that is closest in value to, but not greater than the target number n. The code should work for any list of integers with a length greater than or equal to 1. See sample test results below: Function Call: Returns: 3 closest (5, [1, 3, 6, 9, 22]) closest (15, [22, 9, 16, 3, 1]) |c1osest (5, [-5, 36, 12, 27, б, -14, 19, 27, 341) closest (5, [15, 61, 21, 12, 4, -25, 5, 51, -55]) closest (-10, [-5, -61, -21, -17, 16]) 9 -5 -17

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

python code Write a recursive function such that, given a list of intergers (say v) and an integer value (say x), the function returns resulting subset if there is a subset of intergers in v that sum up to x. Otherwise the function returns an empty list; Also write a sample code that runs this function using an example list and value x, and state the expected result
Write a function in a racket code that takes as input a list of elements and returns a list with elements and their position after. For example, if the input to the function is (list ’a ’b ’c) then it will return (list a 1 b 2 c 3). Make sure to use recursion
Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8
In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.
In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()
Lee has discovered what he thinks is a clever recursive strategy for printing the elements in a sequence (string, tuple, or list). He reasons that he can get at the first element in a sequence using the 0 index, and he can obtain a sequence of the rest of the elements by slicing from index 1. This strategy is realized in a function that expects just the sequence as an argument. If the sequence is not empty, the first element in the sequence is printed and then a recursive call is executed. On each recursive call, the sequence argument is sliced using the range 1:. Here is Lee’s function definition: def printAll(seq): if seq: print(seq[0]) printAll(seq[1:]) Write a program that tests this function and add code to trace the argument on each call. Does this function work as expected? If so, are there any hidden costs in running it?
Implement a recursive C++ function which takes an array of integers (arr) and the starting (start) andending (end) indices of a portion (part) of this array, and returns the index of thelargest element present in that portion of array arr. The prototype of your function should be:int findLargest (int* arr, int start, int end) For example, the function call findLargest(arr,3,8)should determine and return the index of the largest element present in the array arr between the indices 3and 8 (both inclusive)
Write a mutually recursive RACKET function (max-length str-list) that takes one argument, a string-list. ::= () | ( . ) ::= | max-length returns the length of the longest string in str-list. If str-list is the empty list, it returns -1 USE the code below to complete the work (define max-length(lambda (str-list)-1))
Write a recursive function concat str(st) which takes as parameter a list of strings (Ist) and returns a string resulting from concatenating all the items in Ist.
(This question is for a linked list of the type described on the front page, Item 5). Write a recursive function CountGE60. that receives a linked list (may or may not be empty) and returns the number of nodes (each containing a data item value) greater than or equal to 60.
Below,enter code to complete implementation of a recursive function sum_all_integers(), which takes an input n and adds all intergers preceding it, up to n: add_all_integers(n):
Construct recursive versions of the library functions that: a. calculate the "sum" of a list of numbers. b. "take" a given number of elements from the beginning of a list. c. select the "last" element of a non-empty list .