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. , and analyse the a) Design a brute-force algorithm to solve this problem 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] Develop a python code to implement your efficient algorithm. c) 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. , and analyse the a) Design a brute-force algorithm to solve this problem 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] Develop a python code to implement your efficient algorithm. c) depend on the correctness of the code, indentation, comments, test-case] d) Prepare a brief report (250 words) comparing the two algorithms
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
need
![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.
, and analyse the
a) Design a brute-force algorithm to solve this problem
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.
depend on the correctness of the code, indentation, comments, test-case]
d) Prepare a brief report (250 words) comparing the two algorithms](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff7037fa1-d9ae-4bcc-aba2-58f628bd28fc%2F272d449a-9421-4d9f-b110-9264a84a6f11%2Fcluoi7q_processed.png&w=3840&q=75)
Transcribed Image Text: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.
, and analyse the
a) Design a brute-force algorithm to solve this problem
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.
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.
Step by step
Solved in 4 steps with 2 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