# Posts by Tag

## 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...

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.

## 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...

## 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...

## 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.

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.

## 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...

## 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.

## 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...

## 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.

## 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...

## 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.

## 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...

## 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.

## 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...

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.

## 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.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## 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.

## 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...

## 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.

## 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...

## 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.

## 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...

## 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.

## 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...

## 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.

## 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: 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.

## 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...

## 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.

## 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.

## 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.

## 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.

## 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.

## 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...

## 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...

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## Generic data structures in C

This tutorial assumes the reader is familiar with C macros, C pointers, and basic data-structures.

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

## 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.

Description

Description

Description

Description

Description

Description

Description

Description

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## 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...

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## Bash Scripting - Best Practices

A list of best practices when writing bash scripts:

## 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...

## 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...

## 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 ...

## 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 ...

## Writing a Universal Chess Interface (UCI) Client in Java

I love chess, it’s just that chess doesn’t love me back.