Given positions of n friends in the first row of a theater, find the minimal number of moves to sit all friends together. In each move, a friend moves to a seat to the left or a seat to the right. Input: A set of n distinct positive integers in the interval from 1 to N. This set represents positions of n friends that have bought individual (not necessarily adjacent) seats in the first row of a theater. Since all other seats in the first row turned out to be empty, the friends want to start moving to the neighboring seats (to the left or to the right) and continue until they all sit together in n consecutive chairs. Output: Find the minimal number of moves to sit all friends together. 000000000 3 4: 000000000 1+0+3=4

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

Create an efficient java code to solve the problem by using Greedy algorithm only.

Given positions of n friends in the first row of a theater, find the minimal
number of moves to sit all friends together. In each move, a friend moves to a
seat to the left or a seat to the right.
Input: A set of n distinct positive integers in the interval from 1 to N. This set
represents positions of n friends that have bought individual (not necessarily
adjacent) seats in the first row of a theater. Since all other seats in the first row
turned out to be empty, the friends want to start moving to the neighboring seats
(to the left or to the right) and continue until they all sit together in n
consecutive chairs.
Output: Find the minimal number of moves to sit all friends together.
000000000
3
4:27
41
000000000
1+0+3=4
Transcribed Image Text:Given positions of n friends in the first row of a theater, find the minimal number of moves to sit all friends together. In each move, a friend moves to a seat to the left or a seat to the right. Input: A set of n distinct positive integers in the interval from 1 to N. This set represents positions of n friends that have bought individual (not necessarily adjacent) seats in the first row of a theater. Since all other seats in the first row turned out to be empty, the friends want to start moving to the neighboring seats (to the left or to the right) and continue until they all sit together in n consecutive chairs. Output: Find the minimal number of moves to sit all friends together. 000000000 3 4:27 41 000000000 1+0+3=4
Expert Solution
steps

Step by step

Solved in 4 steps with 3 images

Blurred answer
Knowledge Booster
Breadth First Search Algorithm
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.
Similar questions
  • SEE MORE QUESTIONS
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