Laboratory Rats

Vaccine test on laboratory rat/mouse, applied by injection

Will you become a laboratory rat? Covid-19 vaccine volunteers required (100,000+)

If you meet the criteria, all you need to do is sign on the dotted line to confirm:

  • Your loved ones will have no comeback if things go wrong.
  • You keep a diary for 12 to 24 months.
  • You log side effects such as eating more bananas/swinging from trees etc.
  • You will be given £450/£550 out of pocket expenses to and fro appointments.
  • Find out more here:

Further investigation into the Governments current fad of “Being led by the Science?”

Having experience of computer programming and expecially the use of algorithims, my ears pricked at the outset of the virus shamdemic with Neil Ferguson’s predictions of 500,000 deaths. I knew immediately that outcomes are only deliered by the human data input of programmes. Below speaks for itself as to the preparedness of virus outbreaks.

© Crown copyright 2011 First published 10 November 2011 Published to DH website, in electronic PDF format only.

UK Influenza Pandemic Preparedness Strategy

This document describes the Government’s strategic approach for responding to an influenza pandemic. It provides background information and guidance to public and private organisations developing response plans. It takes account of the experience and lessons learned in the H1N1 (2009) influenza pandemic and the latest scientific evidence.


I spoke in my last post of how today’s Government relies heavily on computer algorithms to solve their problems. Unlike their predecessors who took the bull by the horns and hit a problem head-on – pre, Blairism!!!

NameTime in officePolitical party
Edward Heath1970 – 1974Conservative
Harold Wilson1964 – 1970Labour
Alec Douglas-Home1963 – 1964Conservative
Harold Macmillan1957 – 1963Conservative

Below is a sample of a simple algorithm. In other words, ‘IF this happens do this’ if that doesn’t work ‘THEN do this?’

So in the case of lockdown rules shut everything down then apply concessions for being good sheeples!!!

  • Quicksort is another example of divide and conquer
  • Recursive Algorithm:

    — Assume global array S

    void quicksort(low, high: int)

        if low  < high then

            mid: constant int := (low + high) / 2

            partition(low, high, pivot)

            quicksort(low, pivot-1)

            quicksort(pivot+1, high)

    end quicksort

    void partition(LOW, HIGH: int; PIVOTPOINT: out int)

        j: int := LOW

        pivot_item: keytype := S(j)

        for i in LOW+1 .. HIGH loop

            if S(i) < pivot_item then

                j := j + 1

                swap(S(i), S(j))

            end if

        end loop

        PIVOTPOINT := j

        swap(S(LOW), S(PIVOTPOINT))

    end partition

Published by Baz Baron

Naturally I'm a lovely person to know, but as D'Arcy says 'My good opinion once lost is lost forever.'

I love comments :-)

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: