Define a function called get_longest_increasing (numbers_list) which takes a list of integers as a parameter a tuple. The tuple is made up of the starting index of the longest consecutive sequence of increasing values in the list, and the number of elements in the consecutive sequence. For example, consider the list below: [123, 120, 118, 119, 121, 126, 127, 130, 129, 132]
Define a function called get_longest_increasing (numbers_list) which takes a list of integers as a parameter a tuple. The tuple is made up of the starting index of the longest consecutive sequence of increasing values in the list, and the number of elements in the consecutive sequence. For example, consider the list below: [123, 120, 118, 119, 121, 126, 127, 130, 129, 132]
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Python code please help, indentation would be greatly appreciated
![Define a function called
get_longest_increasing
(numbers_list) which takes a list of integers as a parameter and returns
a tuple. The tuple is made up of the starting index of the longest consecutive sequence of increasing values in the parameter
list, and the number of elements in the consecutive sequence. For example, consider the list below:
[123, 120, 118, 119, 121, 126, 127, 130, 129, 132]
The longest consecutive sequence of increasing values in this list begins with the value 118. Starting with the value 118, the next
5 values are in strictly increasing order (119, 121, 126, 127, 130). This is the longest such sequence in the list, and the length of
this sequence is 6 (from 118 to 130). Therefore, the result is:
(2, 6)
If there are two or more increasing sequences of the same length in the list, then the function must return the first one when
reporting the start of the sequence. The function should return None if there are no increasing sequences in the parameter list.
Note: you can assume that the parameter list is not empty.
For example:
Test
Result
(3, 5)
print (get_longest_increasing ( [59, 60, 55, 23, 42, 44, 48, 50, 43, 45, 43, 44, 47, 51, 52]))
print (get_longest_increasing ( [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]))
None
print (get_longest_increasing ( [76, 102, 69, 35, 104, 59, 113, 93, 97, 99]))
(7,3)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff64c4370-50a6-4b0a-be8f-9aa36b172cbb%2Fa21e1aa6-cbce-442a-8556-6955d95904cb%2Frn9vssl_processed.png&w=3840&q=75)
Transcribed Image Text:Define a function called
get_longest_increasing
(numbers_list) which takes a list of integers as a parameter and returns
a tuple. The tuple is made up of the starting index of the longest consecutive sequence of increasing values in the parameter
list, and the number of elements in the consecutive sequence. For example, consider the list below:
[123, 120, 118, 119, 121, 126, 127, 130, 129, 132]
The longest consecutive sequence of increasing values in this list begins with the value 118. Starting with the value 118, the next
5 values are in strictly increasing order (119, 121, 126, 127, 130). This is the longest such sequence in the list, and the length of
this sequence is 6 (from 118 to 130). Therefore, the result is:
(2, 6)
If there are two or more increasing sequences of the same length in the list, then the function must return the first one when
reporting the start of the sequence. The function should return None if there are no increasing sequences in the parameter list.
Note: you can assume that the parameter list is not empty.
For example:
Test
Result
(3, 5)
print (get_longest_increasing ( [59, 60, 55, 23, 42, 44, 48, 50, 43, 45, 43, 44, 47, 51, 52]))
print (get_longest_increasing ( [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]))
None
print (get_longest_increasing ( [76, 102, 69, 35, 104, 59, 113, 93, 97, 99]))
(7,3)
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 3 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY