---
title: "Franco Fernando (@franc0fernand0) | Hashnode"
description: "PhD Sr. Software Engineer. Read the latest articles by Franco Fernando on Hashnode."
url: "https://hashnode.com/@franc0fernand0"
---

@franc0fernand0

# Franco Fernando

@franc0fernand0 · Zurich, Switzerland · Joined July 2021

PhD Sr. Software Engineer

[Website](https://www.francofernando.com/)

### [Algorithms explained: Divide et Conquer vs Dynamic Programming](https://blog.francofernando.com/algorithms-explained-divide-et-conquer-vs-dynamic-programming?utm_source=hashnode&utm_medium=feed)

A guide to chose between the Divide et Conquer and the Dynamic Programming approach while designing an algorithm.

2 min read · [blog.francofernando.com](https://blog.francofernando.com/algorithms-explained-divide-et-conquer-vs-dynamic-programming?utm_source=hashnode&utm_medium=feed)

[Nov 27, 2021](https://hashnode.com/posts/algorithms-explained-divide-et-conquer-vs-dynamic-programming/61a207fcf0cb2e37690c61c3)

### [A step by step guide to the Counting Sort algorithm](https://blog.francofernando.com/a-step-by-step-guide-to-the-counting-sort-algorithm?utm_source=hashnode&utm_medium=feed)

A detailed guide to the counting sort algorithm with implementations in C++, C# and Python.

7 min read · [blog.francofernando.com](https://blog.francofernando.com/a-step-by-step-guide-to-the-counting-sort-algorithm?utm_source=hashnode&utm_medium=feed)

[Oct 2, 2021](https://hashnode.com/posts/a-step-by-step-guide-to-the-counting-sort-algorithm/6158ca08e2f1936f70b26edb)

### [A quick introduction to the ring buffer data structure.](https://blog.francofernando.com/a-quick-introduction-to-the-ring-buffer-data-structure?utm_source=hashnode&utm_medium=feed)

This post presents the Ring Buffer data structure, showing a possible implementation in C++ using templates.

5 min read · [blog.francofernando.com](https://blog.francofernando.com/a-quick-introduction-to-the-ring-buffer-data-structure?utm_source=hashnode&utm_medium=feed)

[Sep 17, 2021](https://hashnode.com/posts/a-quick-introduction-to-the-ring-buffer-data-structure/6145093ea2b54e17a52c0823)

### [Three effective ways to create modulo n integer sequences](https://blog.francofernando.com/three-effective-ways-to-create-modulo-n-integer-sequences?utm_source=hashnode&utm_medium=feed)

This post compare 3 different ways of generating modulo n integer sequences: modulo operator, comparison, bitwise and operator.

3 min read · [blog.francofernando.com](https://blog.francofernando.com/three-effective-ways-to-create-modulo-n-integer-sequences?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/three-effective-ways-to-create-modulo-n-integer-sequences/612aad4cfd0bf8636d76c6ca) [Aug 28, 2021](https://hashnode.com/posts/three-effective-ways-to-create-modulo-n-integer-sequences/612aad4cfd0bf8636d76c6ca)
