From 16706ab5f06a31b3b4e220642ab4414f6f2334e5 Mon Sep 17 00:00:00 2001 From: jwarren-scottlogic Date: Wed, 13 Nov 2024 12:43:27 +0000 Subject: [PATCH] updating episode3 link in post 2 --- _posts/2024-11-04-building-an-assignment-algorithm-2.markdown | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown b/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown index 5c86b1fc4..804d28cb2 100644 --- a/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown +++ b/_posts/2024-11-04-building-an-assignment-algorithm-2.markdown @@ -260,4 +260,4 @@ The value of 2.72 comes from the fact that for a normal distribution, 95.4% of v ## Conclusion -In this blog we have seen how we can measure and maintain fairness across multiple time slots using the idea of compromise. We have also seen how this interacts with sorting surplus differences and how it’s important to find a balance between the two. In the [next and final blog in this series]({{site.baseurl}}/2024/11/11/building-an-assignment-algorithm-3.html), we will look at how ordering time slots can make a significant difference to the outcome of the algorithm, along with concluding how the algorithm comes together as a whole. +In this blog we have seen how we can measure and maintain fairness across multiple time slots using the idea of compromise. We have also seen how this interacts with sorting surplus differences and how it’s important to find a balance between the two. In the [next and final post in this series]({{site.baseurl}}/2024/11/13/building-an-assignment-algorithm-3.html), we will look at how ordering time slots can make a significant difference to the outcome of the algorithm, along with concluding how the algorithm comes together as a whole.