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 …
What is a Data Structure ? A Data structure is basically a mean of storing data in a organized manner that enables efficient access and modification. It can be one of the two following types : Here is the list of Data Structures in Python : As you can see, there are a lot of types. The challenge in …
Introduction If like me, you are a big fan of football (soccer) and new technologies, I am pretty sure you have read at least a blog post or an article about statistics usage in sport! The aim is basically to have better results, to reduce athletes’ injuries and to improve sport science by algorithms usage. …