Given a collection of sticks (line segments) that do not touch each other, determine an order in which you can slide sticks down

without rotating them or touching any other stick, until all sticks have been removed from the table. The picture shows one stick

being slid off the table. (if there are many different solutions, output any one of them)

You may assume that all the coordinates are between 0 and 10,000. Give the order of your algorithm in terms of n, the number of

stick