Posts by Tag

algorithm

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Euclid’s Algorithm

3 minute read

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

Back to Top ↑

computer-science

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

java-implementation

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

c-code

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

3 minute read

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

Back to Top ↑

c-implementation

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

3 minute read

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

Back to Top ↑

euclid

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

3 minute read

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

Back to Top ↑

gcd

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

3 minute read

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

Back to Top ↑

sort

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

java-2

Generic data structures in C

8 minute read

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

Back to Top ↑

conversion

Back to Top ↑

programming-exercise

Back to Top ↑

c-2

Euclid’s Algorithm

3 minute read

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

Back to Top ↑

euclids-algorithm

Euclid’s Algorithm

3 minute read

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

Back to Top ↑

c-sourcecode

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

greatest-common-divisor

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

divide-and-conquer

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

merge

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

merge-sort

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

sorting

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

sorting-algorithms

Bottom-up Merge Sort (non-recursive)

5 minute read

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.

Back to Top ↑

json-to-json

XML to JSON using MapNeat

3 minute read

Following my previous article, I wanted to expand on the capabilities of the mapneat library.

Hello world, mapneat!

4 minute read

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

Back to Top ↑

xml-to-json

XML to JSON using MapNeat

3 minute read

Following my previous article, I wanted to expand on the capabilities of the mapneat library.

Hello world, mapneat!

4 minute read

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

Back to Top ↑

advanced

Generic data structures in C

8 minute read

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

Back to Top ↑

advanced-c

Generic data structures in C

8 minute read

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

Back to Top ↑

c-generics

Generic data structures in C

8 minute read

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

Back to Top ↑

c-tutorial

Generic data structures in C

8 minute read

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

Back to Top ↑

c-templates

Generic data structures in C

8 minute read

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

Back to Top ↑

code-wizard

Generic data structures in C

8 minute read

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

Back to Top ↑

compile-time

Generic data structures in C

8 minute read

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

Back to Top ↑

data-structure

Generic data structures in C

8 minute read

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

Back to Top ↑

generic

Generic data structures in C

8 minute read

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

Back to Top ↑

generic-programming

Generic data structures in C

8 minute read

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

Back to Top ↑

generic-stack

Generic data structures in C

8 minute read

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

Back to Top ↑

generics

Generic data structures in C

8 minute read

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

Back to Top ↑

glib

Generic data structures in C

8 minute read

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

Back to Top ↑

java-generics

Generic data structures in C

8 minute read

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

Back to Top ↑

macro

Generic data structures in C

8 minute read

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

Back to Top ↑

macro-concatenation

Generic data structures in C

8 minute read

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

Back to Top ↑

macro-stringification

Generic data structures in C

8 minute read

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

Back to Top ↑

macros

Generic data structures in C

8 minute read

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

Back to Top ↑

preprocessor

Generic data structures in C

8 minute read

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

Back to Top ↑

preprocessor-hack

Generic data structures in C

8 minute read

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

Back to Top ↑

stack

Generic data structures in C

8 minute read

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

Back to Top ↑

templates

Generic data structures in C

8 minute read

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

Back to Top ↑

calculator

Back to Top ↑

converter

Back to Top ↑

infix

Back to Top ↑

infix-to-rpn

Back to Top ↑

infix-to-rpn-conversion

Back to Top ↑

mathematical-expressions

Back to Top ↑

notation

Back to Top ↑

operators

Back to Top ↑

python

Back to Top ↑

reverse-polish-notation

Back to Top ↑

rpn

Back to Top ↑

shunting-yard-algorithm

Back to Top ↑

c-source

Euclid’s Algorithm

3 minute read

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

Back to Top ↑

greatest-comon-divisor

Euclid’s Algorithm

3 minute read

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

Back to Top ↑

binary-gcd

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

bitwise-operations

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

gcd-optimization

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

gcd-optimize

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

recursive-version

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

steins-algorithm

Binary GCD (Stein’s Algorithm) in C

4 minute read

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

Back to Top ↑

2d-array

Back to Top ↑

fileinputstream

Back to Top ↑

fileoutputstream

Back to Top ↑

graphs

Back to Top ↑

gzip

Back to Top ↑

gzipinputstream

Back to Top ↑

gzipoutputstream

Back to Top ↑

java-io-serializable

Back to Top ↑

marker-interface

Back to Top ↑

objectinputstream

Back to Top ↑

objectoutputstream

Back to Top ↑

programming-2

Back to Top ↑

programming-language

Back to Top ↑

serializable

Back to Top ↑

serialization

Back to Top ↑

very-large-objects

Back to Top ↑

lowest-terms

Back to Top ↑

programming-challenge

Back to Top ↑

reduce-fraction

Back to Top ↑

reduce-given-fraction-to-lowest-terms

Back to Top ↑

algorithm-description

Back to Top ↑

algorithm-implementation

Back to Top ↑

code

Back to Top ↑

insertion

Back to Top ↑

insertion-sort

Back to Top ↑

java-code

Back to Top ↑

java-sourcecode

Back to Top ↑

source

Back to Top ↑

c

Back to Top ↑

max-heap

Back to Top ↑

min-heap

Back to Top ↑

pointer

Back to Top ↑

priority-queue

Back to Top ↑

queue

Back to Top ↑

struct

Back to Top ↑

void

Back to Top ↑

random-data

Generate random SQL inserts using pysert

1 minute read

pysert (with lowercase ‘p’) is a python script capable of generating random SQL data (INSERTS) from predefined templates . Actually, it can generate all kind...

Back to Top ↑

sql-inserts

Generate random SQL inserts using pysert

1 minute read

pysert (with lowercase ‘p’) is a python script capable of generating random SQL data (INSERTS) from predefined templates . Actually, it can generate all kind...

Back to Top ↑

bash

Back to Top ↑

best-practices

Back to Top ↑

echo-errors

Back to Top ↑

portable-shebang

Back to Top ↑

sanity-checks

Back to Top ↑

shebang

Back to Top ↑

stderr

Back to Top ↑

stdout

Back to Top ↑

test-for-read-write-access

Back to Top ↑

test-if-program-is-in-path

Back to Top ↑

test-if-script-is-run-by-user

Back to Top ↑

eigenvalues

Back to Top ↑

eigenvector

Back to Top ↑

events

Back to Top ↑

streams

Back to Top ↑

uci

Back to Top ↑

stockfish

Back to Top ↑