Given an integer array, find the length of the longest subsequence formed by the consecutive integers. The subsequence should contain all distinct values, and the character set should be consecutive, irrespective of its order. For example: Input: [2, 0, 6, 1, 5, 3, 7] Output: 4 Input: [2, 4, 6, 3, 7, 4, 8, 1] Output 4 Explanation: The longest subsequence formed by the consecutive integers is [2, 0, 1, 3]. It has distinct values and length 4. Explanation: The longest subsequence formed by the consecutive integers is (2, 4, 3, 4, 1]. The distinct subsequence is [2, 4, 3, 1] having length 4. a) Design a brute-force algorithm to solve this problem , and analyse the complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity , and analyse the complexity of your solution. [Important instruction to be followed: Create an arbitrary input of at least 5 elements and use it to provide full explanation of how your proposed algorithm should work step by step] c) Develop a python code to implement your efficient algorithm. [The marks Note: depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
Given an integer array, find the length of the longest subsequence formed by the consecutive integers. The subsequence should contain all distinct values, and the character set should be consecutive, irrespective of its order. For example: Input: [2, 0, 6, 1, 5, 3, 7] Output: 4 Input: [2, 4, 6, 3, 7, 4, 8, 1] Output 4 Explanation: The longest subsequence formed by the consecutive integers is [2, 0, 1, 3]. It has distinct values and length 4. Explanation: The longest subsequence formed by the consecutive integers is (2, 4, 3, 4, 1]. The distinct subsequence is [2, 4, 3, 1] having length 4. a) Design a brute-force algorithm to solve this problem , and analyse the complexity of your solution b) Design a more efficient algorithm to do the same task with less complexity , and analyse the complexity of your solution. [Important instruction to be followed: Create an arbitrary input of at least 5 elements and use it to provide full explanation of how your proposed algorithm should work step by step] c) Develop a python code to implement your efficient algorithm. [The marks Note: depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
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
Related questions
Question
Given an integer array, find the length of the longest subsequence formed by the
consecutive integers. The subsequence should contain all distinct values, and the
character set should be consecutive, irrespective of its order.
For example:
Input: [2, 0, 6, 1, 5, 3, 7]
Output: 4
Input: [2, 4, 6, 3, 7, 4, 8, 1]
Output 4
Explanation: The longest subsequence
formed by the consecutive integers is [2,
0, 1, 3]. It has distinct values and length 4.
Explanation: The longest subsequence
formed by the consecutive integers is (2,
4, 3, 4, 1]. The distinct subsequence is [2,
4, 3, 1] having length 4.
a) Design a brute-force algorithm to solve this problem , and analyse the
complexity of your solution
b) Design a more efficient algorithm to do the same task with less complexity ,
and analyse the complexity of your solution.
[Important instruction to be followed: Create an arbitrary input of at least 5 elements
and use it to provide full explanation of how your proposed algorithm should work step
by step]
c) Develop a python code to implement your efficient algorithm. [The marks
Note:
depend on the correctness of the code, indentation, comments, test-case]
d) Prepare a brief report (250 words) comparing the two algorithms
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
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
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education