Algorithms

Originally published on Medium: https://dariodip.medium.com/find-duplicates-like-a-boss-f46422f54dd1 The exercise of finding duplicates in a list is a classical example of a didactic problem that you may find during your journey through learning algorithms. During this post, we will try solving this problem using different algorithms, showing the differences between each one. This article has been mainly written for fun and as a writing exercise. Its main purpose is to show different solutions to a single problem, explaining the reasoning behind certain decisions. ...

Data Structures With Go - Part II This page has been migrated to Medium In the previous post we discussed how to implement linear data structures with Go. Now we will explore two more complex data structures: tree and graph. Those structures are not Linear and can represent unstructured information. Both graphs and trees are the foundation of the graph theory and both can be used, essentially, to describe a kind of relation. ...

Data Structures With Go - Part I This page has been migrated to Medium Data structures are everywhere. Every developer should know them, starting from the most common ones. The data structure priorly describes how the data is organised, accessed, associated and processed. Using data structures you can keep your data in memory and efficiently access them. You should pick the data structure that is the most suitable for your purposes to minimize space in memory and access time. ...

The Binary Search Algorithm This page has been migrated to Medium The Binary Search Algorithm is a search algorithm that works for sorted collections (e.g. sorted arrays). It takes as input a collection, the length of that collection and an element to find, and gives as output the index of the element in the collection (if it exists). This algorithm is as efficient as easy to learn due to its simplicity. ...