Writing a Universal Chess Interface (UCI) Client in Java
I love chess, it’s just that chess doesn’t love me back.
Recent Posts
Cars and Police, a Spring Boot streaming application using Kafka and ksqlDB
Introduction Cars and Police A short introduction to ksqlDB Setting the environment Key concepts (streams and joins) Streams ...
XML to JSON using MapNeat
Following my previous article, I wanted to expand on the capabilities of the mapneat library.
Hello world, mapneat!
One of the most common scenarios I had to solve during my Software Engineering career is to manipulate data, apply some logic on top, eventually change the w...
Computing Eigenvalues and Eigenvectors using QR Decomposition
In my last two articles I’ve tried to explore some fundamental topics in linear algebra: QR Decomposition, linear transformations and Eigenvalues/Eigenvec...
Linear transformations, Eigenvectors and Eigenvalues - an easy explanation
This article is in early editing. It may suffer changes or corrections. If you spot any error please contact me.
Writing your own linear algebra matrix library in C
Table of Contents
HR Schema for MySQL and Maria DB
DML and DDL scripts to generate the HR SQL Schema for MySQL: link.
Bash Scripting - Best Practices
A list of best practices when writing bash scripts:
Generate random SQL inserts using pysert
pysert (with lowercase ‘p’) is a python script capable of generating random SQL data (INSERTS) from predefined templates . Actually, it can generate all kind...
Implementing a generic Priority Queue in C (using heaps)
In Computer Science, a Priority Queue is an abstract data type, very similar to a normal Queue, but with a twist: every element has a priority attached to it...
Insertion Sort Algorithm
Description
Bottom-up Merge Sort (non-recursive)
In the last article I’ve described a recursive version of the Merge Sort Algorithm . Of course every recursive algorithm can be written in an iterative manner.
The merge sort algorithm (implementation in Java)
In computer science many algorithms are recursive by nature, and they usually follow an approach called divide-and-conquer.
Euclid’s Algorithm: Reducing fraction to lowest terms
In the last article I’ve described Euclid’s algorithm for finding the greatest common divisor of two given numbers.
Serialize java objects using GZip streams (GZIPInputStream and GZIPOutputStream)
The code from this article was refactored on 2021-01-03. It now makes use of the “Try with resources” Java feature.
Binary GCD (Stein’s Algorithm) in C
Binary GCD also known as Stein’s Algorithm is an algorithm that computes the greatest common divisor of two (positive) numbers . Discovered in 1967 by the Is...
Euclid’s Algorithm
Recently I’ve started to implement (or reimplement) the most common algorithms a software developer should know . One of the nicest books I found on this top...
Converting infix to RPN (shunting-yard algorithm)
If you’ve tried to write your own calculator (something in the style of calculator) you’ve probably had to build a simple converter for your mathematical exp...
Generic data structures in C
This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.