I'm revising for an Algorithms exam and looking at a sample question it says : A group of n teenagers t1, ... tn are to sit in a single row of n chairs watching a particulary boring comedy movie. Some teenagers quarrel with each other all the time. THE Problem is to devise a seating arrangement for the group in such a way that teenagers sat next to each other do not quarrel. Propose a solution to this problem using the Greedy approach. Estimate the complexity of the resulting algorithm. In lectures for greedy problems we've only covered Knapsack Problems so Next Fit/Best Fit for Bin Packing. I can't seem to understand how these methods have any relevance to coming up with a solution for the question. Obviously I don't expect anyone to answer this, since I've not even made an attempt. But in honesty I don't know where to start. If you guys could give me some sort of hints or just general advice because I'm pretty stranded at the minute. thanks