<?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>Bit Operations on pieterjd.be</title><link>https://pieterjd.github.io/tags/bit-operations/</link><description>Recent content in Bit Operations on pieterjd.be</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><copyright>This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.</copyright><lastBuildDate>Sat, 25 Nov 2023 07:10:23 +0200</lastBuildDate><atom:link href="https://pieterjd.github.io/tags/bit-operations/index.xml" rel="self" type="application/rss+xml"/><item><title>This Algorithm is 1,606,240% FASTER!</title><link>https://pieterjd.github.io/posts/this-algorithm-is-1606240-percent-faster/</link><pubDate>Sat, 25 Nov 2023 07:10:23 +0200</pubDate><guid>https://pieterjd.github.io/posts/this-algorithm-is-1606240-percent-faster/</guid><description>It is all in the title, but in this post I&amp;rsquo;ll go deeper how to represent encountered characters using bits.</description></item></channel></rss>