Analysis of Popular Sorting Algorithms for Websites

Time rate of change: $\frac{}{t}$

• Delicious
  ranks users according to the number of votes per unit time. The item with the most votes will naturally be ranked first.
  The old version of Delicious had a "popular bookmark list", which was calculated in this way.
  It ranks by "number of favorites in last 60 minutes". Count every 60 minutes.
  The advantage of this algorithm is that it is relatively simple, easy to deploy, and the content is updated very quickly; the disadvantage is that, on the one hand, the ranking changes are not smooth enough, and the content that was ranked high in the previous hour often plummets in the second hour; The mechanism of automatically eliminating old items, some popular content may occupy the top of the list for a long time.
• Hacker News
• Reddit
• IMDB ranking formula
• StackOverflow
• SegmentFault

https://www.biaodianfu.com/product-ranking-algorithm.html
https://moz.com/blog/reddit-stumbleupon-delicious-and-hacker-news-algorithms-exposed
https://blog.51cto.com/u_15060458/2674920