Publication date : 02/02/2024

Course : Algorithms, introduction

Practical course - 4d - 28h00 - Ref. AGW
Price : 2100 € E.T.

Algorithms, introduction




This course gives you the basics of algorithmics, essential for writing clean, efficient programs.


INTER
IN-HOUSE
CUSTOM

Practical course in person or remote class
Disponible en anglais, à la demande

Ref. AGW
  4d - 28h00
2100 € E.T.




This course gives you the basics of algorithmics, essential for writing clean, efficient programs.


Teaching objectives
At the end of the training, the participant will be able to:
Knowledge of major sorting algorithms
Knowledge of the main data structures essential to algorithmics
Designing algorithms for graphs and trees

Intended audience
Anyone who needs to learn programming.

Prerequisites
No special knowledge required.

Practical details
Hands-on work
Training alternating theory and practice.

Course schedule

1
Elementary actions, variables and types

  • Elementary actions, variables, elementary types.
  • Loops, procedures and functions.
  • Inheritance and exceptions. How OOP simplifies writing and reading programs/algorithms.
  • Recursivity.
Hands-on work
Conception d’algorithmes avec des boucles imbriquées. Décomposition de programmes en procédures et fonctions. Conception d’algorithmes récursifs.

2
Algorithms on arrays

  • Syntax conventions.
  • Traverse a 1-dimensional array. Calculate sum and average.
  • Find a value in a table of dimension 1. Maximum value, minimum value.
  • Traversing a 2-dimensional array.
  • Find a value in a 2-dimensional array.
Hands-on work
Calculate the transpose of an nxn matrix.

3
Sorting algorithms

  • Bubble sorting.
  • Sorting by selection.
  • Insertion sorting.
  • The heap sort.
  • Merge sorting.
  • The quicksort.
Hands-on work
Comparison of the maximum number of swaps between two algorithms.

4
The main data structures

  • Queues; FIFO structure.
  • Example of an algorithm using a FIFO structure.
  • Stacks; LIFO structure.
  • Example of an algorithm using a stack structure.

5
Algorithms on graphs

  • Graph representation.
  • Graph traversal in width.
  • Search for a minimal spanning tree.
  • Algorithm for finding the shortest paths between all pairs of points.
Hands-on work
Writing a minimum spanning tree search algorithm.

6
Tree traversal algorithms

  • Graph representation.
  • Width first. Sum calculation.
  • First, an in-depth tour.
  • Abandon branch exploration (back-tracking).
Hands-on work
Write an algorithm that requires deep exploration of a tree first.


Customer reviews
3,8 / 5
Customer reviews are based on end-of-course evaluations. The score is calculated from all evaluations within the past year. Only reviews with a textual comment are displayed.
SÉBASTIEN A.
17/06/25
4 / 5

CLEAR
NADIA D.
17/06/25
4 / 5

This course was very advanced for my level _ I've never coded before, so I found it very difficult. We covered advanced algorithmic principles before I was able to understand and practise the basic levels. Thank you to Steeve, our trainer, who was able to adapt to my needs and who taught me so well!
KARIM N.
17/06/25
4 / 5

Overall, the course content was rich and relevant, with a clear and structured presentation, but some concepts were skimmed over or tackled too quickly. In addition, the actual level of content sometimes exceeded that expected for an introductory course, with the introduction of fairly advanced notions/concepts.



Dates and locations
Select your location or opt for the remote class then choose your date.
Remote class

Dernières places
Date garantie en présentiel ou à distance
Session garantie

REMOTE CLASS
2026 : 17 Mar., 9 June, 20 Oct.

PARIS LA DÉFENSE
2026 : 17 Mar., 9 June, 20 Oct.