a code for list c

scheme:  Q9: Sub All Write sub-all, which takes a list s, a list of old words, and a list of new words; the last two lists must be the same length. It returns a list with the elements of s, but with each word that occurs in the second argument replaced by the corresponding word of the third argument. You may use substitute in your solution. Assume that olds and news have no elements in common. (define (sub-all s olds news)    'YOUR-CODE-HERE   )

Beginner C++ Write a program that reads in a list of integers and prints their maximum and minimum. -assume that the integers in the list are separated by one space character “ “ and that the character following the last integer in the list is the newline character '\n' - assume that the integers are between -2^31 and 2^31 -Implement a loop in which the above actions are repeated until the user requests to quit. sample:

Write the following function that returns true if the list is already sorted in increasing order:def isSorted(lst):Write a test program that prompts the user to enter a list and displays whether the list is sorted or not.

Help please in C++ language Sort 231 123 324 100 230 560 using Radix Sort. Hint: Use "0-list", "1-list", etc. named after the "char" you are looking for. Pass 1 Show the sub-lists here based on the last character, Show the combined list. Pass 2 Show the sub-lists here based on the second character, Show the combined list. Pass 3 Show the sub-lists here based on the first character, Show the combined list.

OCaml Code: Please read the attached instructions carefully and show the correct code with the screenshot of the output. I really need help with this assignment.

JS Write a function named find_value that takes a list/array of whole numbers as a parameter. Your functio will need to find if the parameter contains the value 3 as an entry. Return true if the input has an entry equivalent to 3 and false if it does not.

Question > Not complete Marked out of 1.50 Flag question Previous page Write a recursive function named get_palindromes (words) that takes a list of words as a parameter. The function should return a list of all the palindromes in the list. The function returns an empty list if there are no palindromes in the list or if the list is empty. For example, if the list is ["racecar", "hello", "noon", "goodbye"], the function should return ["racecar", "noon"]. A palindrome is a word that is spelled the same forwards and backwards. Note: The get_palindromes() function has to be recursive; you are not allowed to use loops to solve this problem. For example: Test words = ["racecar", "hello", "noon", "goodbye", "test", 'aibohphobia'] ['racecar', 'noon', 'aibohphobia'] print (get_palindromes (words)) print (get_palindromes ([])) print (get_palindromes (['this', 'is', 'test'])) Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %) Result Precheck Check [] [] Next page

python program plz

Python code please help, indentation would be greatly appreciated