Algorithm for sorting most recent likes

Searches, and search engines example from a Well House Consultants training course
More on Searches, and search engines [link]

This example is described in the following article(s):
• Selecting RECENT and POPULAR news and trends for your web site users - [link]

If you're searching for a page where you can try this code, select here

This example references the following resources:
http://www.firstgreatwestern.info/coffeeshop/index.php?topic=$inner[1].msg$inner[0]
http://www.wellho.net/mouth/4401_Selecting-RECENT-and-POPULAR-news-and-trends-for-your-web-site-users.html

Source code: liked.php Module: H308


<?php

# Algorithm for sorting most recent likes

/* Our Coffee Shop forum has a like button and this code looks through the databases
and offers visitors a selection of topical threads based on recent likes */

$c = mysql_connect("127.0.0.1","fgw","/password goes here/");
mysql_select_db("fgw",$c);

$scoreboard = array();
$already = array();
$countdown = 60;
$showrows = $countdown / 2;
$html = "";

/* Here is the actual scoring algorithm */

$r = mysql_query("select * from lykes order by timing desc limit $countdown");
while (list($id,$post,$user,$when) = mysql_fetch_row($r)) {
        $scoreboard[$post] += ($countdown *= 0.94);
        # $scoreboard[$post] += $countdown--;  /* Alternative to previous line */
        }

/* Sort the results */

arsort($scoreboard) ;

/* Build up the response page */

foreach (array_keys($scoreboard) as $post) {
        $r = mysql_query("select id_msg, id_topic, smf_messages.id_board, subject, memberGroups, posterTime ".
                "from smf_messages join smf_boards on smf_messages.id_board = smf_boards.id_board where id_msg = $post");
        $inner = mysql_fetch_row($r);
        if ($already[$inner[1]]) continue;              /* Eliminate multiple reports in same thread */
        $already[$inner[1]]++;
        if (preg_match('/-1/',$inner[4])) {             /* Eliminate non-public posts */
                $ttl = preg_replace('/[rR]e: /','',$inner[3]);
                $when = date("H:i, jS M",$inner[5]);
                if (date("Y",time()) != date("Y",$inner[5]) and time() - $inner[5] > 3600 * 24 * 31)  $when = date("jS M Y",$inner[5]);
                $html .= "<a href=http://www.firstgreatwestern.info/coffeeshop/index.php?topic=$inner[1].msg$inner[0] target=xyz>[*]</a> ";
                $html .= "score ".sprintf("%d",$scoreboard[$post]) ."  - $when - $ttl<br />\n";
                if ($showrows-- < 1) break;
        } else {
                # $html .= "missed <br />";
        }
        }

#-------------------  Template for report (view) -------------------------------
?>
<html>
<head>
<title>Great Western Coffee Shop - most liked posts</title>
</head>
<body>
<h1>Most recently liked public posts ...</h1>
<?= $html ?><br />
... on the <a href=http://www.firstgreatwestern.info>First Great Western Coffee Shop</a>
<hr>
Fine print. Only reports most popular post in any one thread. Only reports on public boards.
Time and date stamp and popularity is based on the time of liking not the time of posting,
but the time stamp in the table above refers to the original post date and time for the liked article.
Scores are an arbitary weighted measure. "Re: " has been taken off the start of the subject
where it was a reply that was likes.
See <a href=http://www.wellho.net/mouth/4401_Selecting-RECENT-and-POPULAR-news-and-trends-for-your-web-site-users.html>[here]</a>
for more details of our algorithm.
</body>
</html>

Learn about this subject

This module and example are covered on our public PHP Techniques course. If you have a group of three or more trainees who need to learn the subject, we can also arrange a private or on site course for you.

Books covering this topic

Yes. We have over 700 books in our library. Books covering PHP are listed here and when you've selected a relevant book we'll link you on to Amazon to order.

Other Examples

This example comes from our "Searches, and search engines" training module. You'll find a description of the topic and some other closely related examples on the "Searches, and search engines" module index page.

Full description of the source code

You can learn more about this example on the training courses listed on this page, on which you'll be given a full set of training notes.

Many other training modules are available for download (for limited use) from our download centre under an Open Training Notes License.

Other resources

• Our Solutions centre provides a number of longer technical articles.
• Our Opentalk forum archive provides a question and answer centre.
• The Horse's mouth provides a daily tip or thought.
• Further resources are available via the resources centre.
• All of these resources can be searched through through our search engine
• And there's a global index here.

Web site author

This web site is written and maintained by Well House Consultants.

Purpose of this website

This is a sample program, class demonstration or answer from a training course. It's main purpose is to provide an after-course service to customers who have attended our public private or on site courses, but the examples are made generally available under conditions described below.

Conditions of use

Past attendees on our training courses are welcome to use individual examples in the course of their programming, but must check the examples they use to ensure that they are suitable for their job. Remember that some of our examples show you how not to do things - check in your notes. Well House Consultants take no responsibility for the suitability of these example programs to customer's needs.

This program is copyright Well House Consultants Ltd. You are forbidden from using it for running your own training courses without our prior written permission. See our page on courseware provision for more details.

Any of our images within this code may NOT be reused on a public URL without our prior permission. For Bona Fide personal use, we will often grant you permission provided that you provide a link back. Commercial use on a website will incur a license fee for each image used - details on request.