New ask Hacker News story: Suggest HN: Sort by most upvoted comment in subtree
Suggest HN: Sort by most upvoted comment in subtree
2 by NoRelToEmber | 0 comments on Hacker News.
A highly-upvoted reply may still be buried if the parent comment gets few upvotes. Sorting by the most upvoted element of the entire comment subtree, instead of just by its root, would fix this. There may be unwanted side-effects, so this could be just an experiment or option at first. If comments are already sorted in a less naive way than I have assumed, or if this was already rejected for other reasons, you may consider this suggestion moot.
2 by NoRelToEmber | 0 comments on Hacker News.
A highly-upvoted reply may still be buried if the parent comment gets few upvotes. Sorting by the most upvoted element of the entire comment subtree, instead of just by its root, would fix this. There may be unwanted side-effects, so this could be just an experiment or option at first. If comments are already sorted in a less naive way than I have assumed, or if this was already rejected for other reasons, you may consider this suggestion moot.
Comments
Post a Comment