A list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. Define a predicate isSorted that expects a list as an argument and returns True if the list is sorted, or returns False otherwise. (Hint: For a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return False if the first item in a pair is greater.)

 

2 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:  a script that tests this function and add code to trace the argument on each call. Does this function work as expected? If so, explain how it actually works, and describe any hidden costs in running it.

 

a program that computes and prints the average of the numbers in a text file. You should make use of two higher-order functions to simplify the design.

Transcribed Image Text:

▸ Details def printA11(seq): if seq: print (seq[0]) printA11 (seq[1:]) ▸ Details def printA11(seq): if seq: print (seq[0]) printA11 (seq[1:])

Answer rating: 100% (QA)

isSorted predicate in Python def isSortedlst if lenlst lsti 1 return False return True This function ... View the full answer