From: Dessalines Date: Mon, 26 Aug 2019 20:14:14 +0000 (-0700) Subject: Adding link for ranking. X-Git-Url: http://these/git/%7B%60%24%7BwebArchiveUrl%7D/%22%7B%7D/readmes/%7B%7D/%22%7Burl%7D/%7BelementUrl%7D?a=commitdiff_plain;h=25e23af5555048282bd6053bd0bbed812bd44f2a;p=lemmy.git Adding link for ranking. --- diff --git a/docs/ranking.md b/docs/ranking.md index 608b5484..361dc24d 100644 --- a/docs/ranking.md +++ b/docs/ranking.md @@ -5,7 +5,7 @@ - Use a log scale, since votes tend to snowball, and so the first 10 votes are just as important as the next hundred. ## Reddit Sorting -[Reddit's comment sorting algorithm](https://medium.com/hacking-and-gonzo/how-reddit-ranking-algorithms-work-ef111e33d0d9), the wilson confidence sort, is inadequate, because it completely ignores time. What ends up happening, especially in smaller subreddits, is that the early comments end up getting upvoted, and newer comments stay at the bottom, never to be seen. +[Reddit's comment sorting algorithm](https://medium.com/hacking-and-gonzo/how-reddit-ranking-algorithms-work-ef111e33d0d9), the wilson confidence sort, is inadequate, because it completely ignores time. What ends up happening, especially in smaller subreddits, is that the early comments end up getting upvoted, and newer comments stay at the bottom, never to be seen. Research showed that nearly all top comments are just the [first ones posted.](https://minimaxir.com/2016/11/first-comment/) ## Hacker News Sorting The [Hacker New's ranking algorithm](https://medium.com/hacking-and-gonzo/how-hacker-news-ranking-algorithm-works-1d9b0cf2c08d) is great, but it doesn't use a log scale for the scores.