Introduction A pull request flow is a lightweight, 6 steps, branch-based workflow. Note: this guide some quotations from GitHub Guides (Open Source). Here is an overview of the pull request workflow: 0. “Pull” the changes to your local machine (get the most recent base) 1. Create a “branch” (version) 2. Commit the changes 3.a Push…

Introduction “Git is a free and open source distributed version control system designed to handle everything from small to very large projects with speed and efficiency. Git is easy to learn and has a tiny footprint with lightning fast performance.” (Git) But first thing first : what is a “version control…

Introduction In our previous courses, we have seen how to perform the four fundamental operations (add, subtract, multiply and divide) on both natural numbers and integers. However, we didn’t handle more complex cases such as when it was not dividing things up exactly. …

Here is a glossary of many terms used every day by tech people and programmers; this is a light and general glossary of many terms. Definitions are kept as simple and short as possible. This may be used as a first overview of the programming world. This glossary is also…

In the previous lesson, we have learned about natural, or whole, numbers (0, 1, 2, 3…). It’s now time to enlarge our vision of numbers with integers. Integers are just like whole numbers, but they also include negative numbers: {…-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5…}…

A natural number is a positive and “without comma” number such as 1, 2, 3 … and 0. The smallest element is 0 and there is no greater element: you can count without ever stopping. Natural numbers are the most commonly used numbers in everyday life, they allow you to…

Introduction In this introduction we will see the vocabulary and the calculation rules used for all the set of numbers. This may seem complicated at first, but for each set (see Quick Access above) we will explain in detail and with examples how to do it. …

Introduction A Binary Search Tree (BST), Ordered Tree or Sorted Binary is the first tree data structure we are studying. Unlike Arrays, Linked Lists, Stacks and Queues which are linear data structures, a Tree is a hierarchical (and nonlinear) data structure which is intrinsically recursive. Still, BST are easy to understand…

Introduction What’s the shortest drive from our place to the nearest park? How do we find a way through a maze? Can we program a game character to find the exit avoiding enemies? Pathfinding algorithms address the problem of finding a path from a source to a destination avoiding obstacles and…