Franco Fernando

@franc0fernand0

Website

PhD Sr. Software Engineer

Zurich, SwitzerlandJoined July 2021

About

I am a senior software engineer with more than 10 years of experience and a PhD in computer vision.

I currently work in the healthcare industry developing software for cancer diagnosis and treatment.

My tech stack is includes: C/C++, Python, C# and many frameworks and libraries.

I love continuously learning new things, creating content and helping other developers to get better.

Available for

Nothing here yet.

Franco Fernando's blogs

Franco Fernando's Blogblog.francofernando.com4 posts

Articles Comments1

Recently published

FFFranco Fernandoblog.francofernando.comNov 27, 2021 · 2 min read

Algorithms explained: Divide et Conquer vs Dynamic Programming

Divide and Conquer (D&C) and Dynamic Programming (DP) are 2️⃣ great algorithmic techniques. Both divide a given problem into subproblems and solve the subproblems. How do you choose which one is better to use for solving a problem ? To answer this qu...

0

FFFranco Fernandoblog.francofernando.comOct 2, 2021 · 7 min read

A step by step guide to the Counting Sort algorithm

While all comparison-based algorithms have a time complexity of O(nlogn) to sort an array of n elements, there are sorting algorithms running in linear time provided that some assumptions are verified. Counting sort is one of such algorithms and thi...

0

FFFranco Fernandoblog.francofernando.comSep 17, 2021 · 5 min read

A quick introduction to the ring buffer data structure.

Ring buffers (also known as circular buffers) are fixed-size buffers that works as if the memory were contiguous and circular. The data inside the ring buffer are delimited by two pointers that are adjusted when a new data is generated or an existin...

0

FFFranco Fernandoblog.francofernando.comAug 28, 2021 · 3 min read

Three effective ways to create modulo n integer sequences

This article was originally published on my personal website. A modulo n integer sequence is just a (potentially infinite) integer sequence that wrap to 0 when the current value is n. For example, $$ 0,1,2,3,4,0,1,2,3,4,...$$ is a modulo 5 integer se...

1

C

Franco Fernando

About

Available for

Franco Fernando's blogs

Recently published

Algorithms explained: Divide et Conquer vs Dynamic Programming

A step by step guide to the Counting Sort algorithm

A quick introduction to the ring buffer data structure.

Three effective ways to create modulo n integer sequences

Search Hashnode

Franco Fernando

About

Available for

Franco Fernando's blogs

Recently published

Algorithms explained: Divide et Conquer vs Dynamic Programming

A step by step guide to the Counting Sort algorithm

A quick introduction to the ring buffer data structure.

Three effective ways to create modulo n integer sequences