skyrockect9

4 ms·

1. 1.▲
   by skyrockect9 11y ago

   The hope is that the remaining elements in the list l are similar in the sense that max(l)/min(l) is small, the heuristic could be improved one you try to make a trade off between max(l)/min(l) in the list and the difference betwe
2. 2.▲
   by skyrockect9 11y ago

   The first heuristic algorithm that jumps to my mind to solve this problem goes like this: First sort the numbers into a list. Second take elements from the head of the list to construct a subset A. Third take elements from the tail to con
3. 3.▲
   by skyrockect9 11y ago

   Some minutes ago I submitted the question: What do you do when you get bored, and the HN team delete it, so perhaps you can submit your story but the reviewers can delete it.