Suppose we have a sequence of numbers: 1, 8, 5, 2, 6, 3, 9, 7, 4, 2, 3. We aim to find a longest turbulence in the sequence. 'Turbulence' is a consecutive sub-sequence where the numbers rise and drop alternately. Every sub- sequence of a turbulence is also a turbulence. For example, 1 and 8 and 5 are all turbulences because each of them contains only one number. 1,8 and 8,5 are both turbulences because 1 rises to 8 in the first sequence and 8 drops to 5 in the second. 1,8,5 is a turbulence because 1 rises to 8 and then drops to 5. 8,5, 2 is not a turbulence because 8 drops twice (first to 5 and then to 2). The longest turbulence in the given sequence is 5, 2, 6, 3, 9,7. Can you design a brute-force algorithm to find the longest turbulence in a given sequence of numbers (such as the sequence provided above)? What is its time complexity in terms of big-O? (word limit: 200) Question 21 Can you describe an algorithm that is likely to achieve better running time than brute-force for Question 20? (word limit: 200).

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
icon
Related questions
Question

Help me

Question 20
Suppose we have a sequence of numbers: 1, 8, 5, 2, 6, 3, 9, 7, 4, 2, 3. We aim to find a longest turbulence in the
sequence. 'Turbulence' is a consecutive sub-sequence where the numbers rise and drop alternately. Every sub-
sequence of a turbulence is also a turbulence. For example,
1 and 8 and 5 are all turbulences because each of them contains only one number.
1,8 and 8,5 are both turbulences because 1 rises to 8 in the first sequence and 8 drops to 5 in the second.
1,8,5 is a turbulence because 1 rises to 8 and then drops to 5.
●
8,5, 2 is not a turbulence because 8 drops twice (first to 5 and then to 2).
The longest turbulence in the given sequence is 5, 2, 6, 3,9,7.
Can you design a brute-force algorithm to find the longest turbulence in a given sequence of numbers (such as the
sequence provided above)? What is its time complexity in terms of big-O? (word limit: 200)
Question 21
Can you describe an algorithm that is likely to achieve better running time than brute-force for Question 20? (word
limit: 200).
Transcribed Image Text:Question 20 Suppose we have a sequence of numbers: 1, 8, 5, 2, 6, 3, 9, 7, 4, 2, 3. We aim to find a longest turbulence in the sequence. 'Turbulence' is a consecutive sub-sequence where the numbers rise and drop alternately. Every sub- sequence of a turbulence is also a turbulence. For example, 1 and 8 and 5 are all turbulences because each of them contains only one number. 1,8 and 8,5 are both turbulences because 1 rises to 8 in the first sequence and 8 drops to 5 in the second. 1,8,5 is a turbulence because 1 rises to 8 and then drops to 5. ● 8,5, 2 is not a turbulence because 8 drops twice (first to 5 and then to 2). The longest turbulence in the given sequence is 5, 2, 6, 3,9,7. Can you design a brute-force algorithm to find the longest turbulence in a given sequence of numbers (such as the sequence provided above)? What is its time complexity in terms of big-O? (word limit: 200) Question 21 Can you describe an algorithm that is likely to achieve better running time than brute-force for Question 20? (word limit: 200).
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Time complexity
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education