If you’re interested in writing Python, then at some point you’ve probably wondered how to automate parts of your life, and have your script run automatically on its own.

In this article, I’m going to explain a simple python script to send emails, and how you can have that email…


Today, I want to talk about WordPress a content management service (CMS). CMS is an application used to manage and publish web content in a really simple user-friendly way. It allows marketers, content creators, and merchandisers to interact with the website without having to use the IT department. In a…


Recently I found myself in need of some open-source information. There are multiple ways to gather information on the web. You could use Selenium to scrape the web (although sites make that more difficult every year). …


At some point in your web development journey you’ll want full control of your website, and mastering the art of web hosting can bring you closer to that goal. If you’re reading this article I assume you’re comfortable looking at code, and using the linux terminal. …


Dijkstra’s algorithm is an algorithm used to find all of the shortest distances between a start vertex and the rest of the vertices in a graph. Above you can see we start at A, and from there we will find the shortest distance to all other vertices. …


example of depth-first-search

I wanted to discuss two types of graph search algorithms, as they are important concepts in working with graph structures.

The first is known as Depth First Search (DFS). As you can see in the gif above it travels down the vertices of a graph one by one via its…


Binary Search vs Linear Search methods

Two common search methods are linear, where we iterate through a list one-by-one till we find the value we want, or binary, where we apply a search formula/logic to more quickly find our target. There are benefits for both, and I wanted to go over them today.

When implementing a…


Radix Sort

You ever just study something that’s made you mad? Like programming doesn’t need to be this hard, and yet you still find yourself trying to understand Radix Sort. …


example of quick sort logic

Quick-sort is another divide and conquer algorithm like the merge_sort algorithm. Quick-sort’s unique method however makes it oddly efficient, and thus popular.

It’s a recursion operation, and calls upon itself to break an array into multiple sub-list. …


Continuing my series on python sorting algorithms today I’m going to look at Merge Sort. Merge sort is a divide, and conquer strategy where it breaks down your list into halves repeatedly until it has just one element, and reconstructs the list in order. …

Abel Garrido

I’m a web developer, and data scientist by hobby. Yes, it can be a hobby. I blog about all things code.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store