<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Fun on The Final Artefact</title><link>https://www.thefinalartefact.xyz/categories/fun/</link><description>Recent content in Fun on The Final Artefact</description><generator>Hugo</generator><language>en-gb</language><lastBuildDate>Fri, 14 Mar 2025 00:00:00 +0000</lastBuildDate><atom:link href="https://www.thefinalartefact.xyz/categories/fun/index.xml" rel="self" type="application/rss+xml"/><item><title>Version Control your Dotfiles</title><link>https://www.thefinalartefact.xyz/post/git-dotfiles/</link><pubDate>Fri, 14 Mar 2025 00:00:00 +0000</pubDate><guid>https://www.thefinalartefact.xyz/post/git-dotfiles/</guid><description>&lt;p&gt;&lt;a href="https://www.thefinalartefact.xyz/post/git-dotfiles/images/imageGitStatus.png" target="_blank" rel="noopener noreferrer"&gt;
&lt;img alt="Using git to version control dotfiles" loading="lazy" src="https://www.thefinalartefact.xyz/post/git-dotfiles/images/imageGitStatus.png"&gt;
&lt;/a&gt;&lt;/p&gt;
&lt;h2 id="what-are-dotfiles"&gt;What are .dotfiles?&lt;/h2&gt;
&lt;p&gt;Dotfiles are hidden configuration files on Unix-like systems.&lt;br&gt;
Their filenames start with a dot (&lt;code&gt;.&lt;/code&gt;), making them hidden by default.&lt;br&gt;
They store preferences and settings for programs like shells, text editors, and version control systems.&lt;/p&gt;
&lt;p&gt;Many modern Linux applications follow the XDG Base Directory Specification.&lt;br&gt;
This guideline recommends placing user-specific configuration files in &lt;code&gt;~/.config&lt;/code&gt; (or &lt;code&gt;$XDG_CONFIG_HOME&lt;/code&gt;).&lt;br&gt;
Using this standard reduces clutter in home directories and simplifies managing configurations across systems.&lt;/p&gt;</description></item><item><title>Showing ChatGPT How to Draw</title><link>https://www.thefinalartefact.xyz/post/drawing-chat-gpt/</link><pubDate>Wed, 14 Jun 2023 00:00:00 +0000</pubDate><guid>https://www.thefinalartefact.xyz/post/drawing-chat-gpt/</guid><description>&lt;h2 id="background"&gt;Background&lt;/h2&gt;
&lt;p&gt;For a computer, an image is collection of interpretable instructions that amount to a visual representation. Raster images are composed from using pixels, containing unique colours, whereas vector images keep track of points and equations that join them. In &lt;code&gt;\(\LaTeX\)&lt;/code&gt; PGF/TikZ is used to generate vector graphics from algebraic descriptions. TikZ is mostly used to conveniently draw various scientific figures. ChatGPT is capable of generating computer code in majority of popular languages. I wanted to test how far I can get with ChatGPT generating illustrations using TikZ.&lt;/p&gt;</description></item><item><title>Beauty of R and Big-O</title><link>https://www.thefinalartefact.xyz/post/beauty-of-r-and-big-o/</link><pubDate>Thu, 09 Dec 2021 00:00:00 +0000</pubDate><guid>https://www.thefinalartefact.xyz/post/beauty-of-r-and-big-o/</guid><description>&lt;script src="index_files/kePrint/kePrint.js"&gt;&lt;/script&gt;
&lt;link href="index_files/lightable/lightable.css" rel="stylesheet" /&gt;
&lt;h2 id="big-o"&gt;Big-O&lt;/h2&gt;
&lt;p&gt;The purpose of this is not to provide yet another primer on the Big-O/$\Omega$/$\Theta$ notation but to share my enduring appreciation for working with R. I will introduce Big-O only briefly to provide context but I would refer all of those who are interested to the linked materials.&lt;/p&gt;
&lt;h2 id="what-is-big-sth-notation"&gt;What is Big-sth notation&lt;/h2&gt;
&lt;p&gt;When analysing functions, we may be interested in knowing how fast a function grows. For instance, for function &lt;code&gt;\(T(n)=4n^2-2n+2\)&lt;/code&gt;, after ignoring constants, we would say that &lt;code&gt;\(T(n)\)&lt;/code&gt; grows at the order of &lt;code&gt;\(n^2\)&lt;/code&gt;. With respect to the &lt;em&gt;Big-O&lt;/em&gt; notation we would write &lt;code&gt;\(T(n)=O(n^2)\)&lt;/code&gt;^[MIT. (2021, December 9). Big O notation. Introduction to Computers and Programming. Retrieved December 26, 2021, from &lt;a href="https://web.mit.edu/16.070/www/lecture/big_o.pdf"&gt;https://web.mit.edu/16.070/www/lecture/big_o.pdf&lt;/a&gt;]. Most commonly, in computer science, we would differentiate between Big O, Big Theta &lt;code&gt;\((\Theta)\)&lt;/code&gt; and Big Omega &lt;code&gt;\((\Omega)\)&lt;/code&gt;. In a nutshell, the differences between those common notations can be summarised as follows:&lt;/p&gt;</description></item><item><title>On Sorting Arrays...or why it's good to read the actual assignment</title><link>https://www.thefinalartefact.xyz/post/fun-with-sortting-arrays/</link><pubDate>Sun, 23 May 2021 00:00:00 +0000</pubDate><guid>https://www.thefinalartefact.xyz/post/fun-with-sortting-arrays/</guid><description>&lt;h2 id="problem"&gt;Problem&lt;/h2&gt;
&lt;p&gt;Solving challenges on &lt;a href="https://projecteuler.net"&gt;project Euler&lt;/a&gt; or &lt;a href="https://www.hackerrank.com/"&gt;HackerRank&lt;/a&gt; is a good past time. For folks working in the wider analaytical / data science field, places like project Euler provide an excellent opportunity to work with academic programming concepts that do not frequently appear in real-life. I was looking at common problem:&lt;/p&gt;
&lt;blockquote&gt;
&lt;p&gt;You are given an unordered array consisting of consecutive integers [1, 2, 3, &amp;hellip;, n] without any duplicates. You are allowed to swap any two elements. Find the minimum number of swaps required to sort the array in ascending order.&lt;br&gt;
Example
Perform the following steps:&lt;/p&gt;</description></item></channel></rss>