Alice writes n distinct integers on a blackboard, and picks a positive integer K. She chen allows Bob to make moves, each of which consist of the following steps. 1. Identify two integers x and y on the blackboard which differ by at most K, i.e. |æ – y| < K. 2. Erase the smaller of the two chosen integers. Bob's task is to make moves in this way until he is no longer able to do so. Note that n some cases, Bob may be unable to make even a single move. Design an algorithm which runs in O(n log n) time and finds the longest sequence of moves. If there are several sequences of maximum length, you may find any of them.

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...
icon
Related questions
Question
Alice writes n distinct integers on a blackboard, and picks a positive integer K. She
then allows Bob to make moves, each of which consist of the following steps.
1. Identify two integers x and y on the blackboard which differ by at most K, i.e.
|x – y| < K.
2. Erase the smaller of the two chosen integers.
Bob's task is to make moves in this way until he is no longer able to do so. Note that
in some cases, Bob may be unable to make even a single move.
Design an algorithm which runs in O(n log n) time and finds the longest sequence of
moves. If there are several sequences of maximum length, you may find any of them.
Transcribed Image Text:Alice writes n distinct integers on a blackboard, and picks a positive integer K. She then allows Bob to make moves, each of which consist of the following steps. 1. Identify two integers x and y on the blackboard which differ by at most K, i.e. |x – y| < K. 2. Erase the smaller of the two chosen integers. Bob's task is to make moves in this way until he is no longer able to do so. Note that in some cases, Bob may be unable to make even a single move. Design an algorithm which runs in O(n log n) time and finds the longest sequence of moves. If there are several sequences of maximum length, you may find any of them.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY