Introduction The twelve-factor application is a methodology for Softwares or web applications deployed in the cloud. These best practices are designed to enable applications to be built with portability and resilience when deployed to the web. The purpose is the following : once you develop and set your application, it has to smoothly operate from the Cloud without having …
Introduction In this article, we will see together different basic concepts about Software Testing. There are different goals around it. The first one is obviously to search for defects than can be fixed to improve software quality. Then to validate that the software meets its purpose and finally facilitate refactoring and upgrades by validating that everything is still working after. As seen …
Introduction DevOps engineers must be comfortable with Linux but also with softwares and programming languages like Python, NodeJS and Java. It’s important to understand how applications are built, deployed and how to troubleshoot, in order to be able to setup CI/CD. In this article, we will see together 3 of the most used programming languages used. Java …
What is PEP8 ? We have seen several topics on Python in my previous articles (here). Today, we will discuss about PEP8 convention. 🙂 PEP8 is coding conventions for the Python code comprising the standard library in the main Python distribution. It exists to improve the readability of Python code. As you know, we spend more time …
Introduction Recursion is a way of solving a problem by having a function calls itself. In this article we will use factorials as an example with Python. Factorials Do you remember what are factorials ? Pretty easy : n! = n * (n-1) * (n-2) * (n-3) * (n-4) * …. * 3 * 2 …
Introduction A hashing algorithm’s goal is to generate a value computed from a base input number using a hashing function which are one way functions. It’s generally a cryptographic function that maps data of arbitrary size to a hash of a fixed size. The ideal hash function should respect the following points : As you …
Introduction As we explained it in the Data Structure article, “Graphs algorithms” are used a lot in real-life. They are used to represent networks like you can find in cities, phones or even in Facebook where each person is represented by a node. Each node contains information like the name, the gender, the phone number …
Introduction Dynamic Programming is basically used to resolve problems by dividing them into sub-problems. You will begin with the smallest first and then continue with bigger ones. It has been introduced by Richard Bellman in the 50s. When should we use it ? When we have optimal structure and overlapping subproblems : Example with Fibonacci sequence …
In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure. In this article we will take a look at two simple search algorithms. Linear search How it works ? The easiest search algorithm you can imagine ! Also known as sequential search this is a method for finding an element …
Introduction In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing, and automated reasoning tasks. Some algorithms are better than others even if they produce equal results. Generally, the fewer steps it takes to compute, the better it is. But sometimes we care …