Question

Problem 5

in python, write a function called sequencelength that accepts two input arguments: a list of integers (called mylist here) and an integer (called x here). The function should return True if mylist contains an increasing sequence with a length of at least x values. Otherwise, the function should return False. An increasing sequence of numbers is one in which each number is larger than the one before it. For example, [4, 8, 13, 14, 21] is an increasing sequence of length 5, but [4, 8, 13, 12, 21] is not.

Examples:
sequencelength([1, 4, 3, 7, 8, 5, 9], 2)  True sequencelength([1, 4, 3, 7, 8, 5, 9], 3)  True sequencelength([1, 4, 3, 7, 8, 5, 9], 4)  False sequencelength([2, 4, 6, 5, 7, 9, 11, 8, 12, 13], 4)True sequencelength([2, 4, 6, 5, 7, 9, 11, 8, 12, 13], 5)  False

Answer 1

Here I am posting code and screenshot of program with output .

In this problem in function sequencelength(list,n) firstly I find longest increasing sequence then compare with given desired length of longest increasing sequence and return True and False accordingly.

Code :-

# function to find list contains an increasing sequence of length n
def sequencelength(list,n):
    # intialization of variable
    maxlength = 0
    count = 0
    # loop to traverse through list element
    for i in range(0,len(list)):
        # first element of list so it is always a increasing sequence
        if i == 0:
            # increment in count i.e in increasing sequence
            count += 1
            # check whether current count is greater then previous max length or not
            maxlength = max(maxlength,count)
        # if next element in list is greater then current element
        elif list[i] > list[i-1]:
            # increment in count i.e in increasing sequence
            count += 1
            # check whether current count is greater then previous max length or not
            maxlength = max(maxlength, count)
        # if next element in list is less then current element so break in increasing sequence 
        # reset count to 1
        else:
            count = 1
    # check whether length of longest increasing sequence is greater then or equal to 
    # desired length or not
    if maxlength >= n:
        return True
    else:
        return False

n = int(input("Enter number of element in my_list "))
my_list = []
print("Enter my_list element ")
for i in range(0,n):
    my_list.append(int(input()))
x = int(input("desired length of increasing sequence in list"))
print(sequencelength(my_list,x))

Screenshot of program with output :-