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
4,7 / 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.
DAVID K.
09/06/26
5 / 5

The difficulty builds gradually and is well-structured. This section really made me adapt and forced my brain to switch into learning and logical thinking mode. I love it! As a beginner, you’ll need to go over certain parts of the day’s work in the evening – that’s to be expected.
NOÉMIE L.
09/06/26
5 / 5

I really found this training course very interesting. The way it alternates between theory and practice is brilliant, because it allows you to put what you’re learning into practice. The trainer was also a very good teacher, passionate about his field and driven by a genuine desire to pass on his knowledge.
DONATELLE L.
09/06/26
4 / 5

The trainer has excellent teaching skills, explains things very clearly and the course materials are very comprehensive. Some of the course content was a little too advanced for my level (beginner), but that was as per the syllabus.



Publication date : 02/02/2024



This programme is an original creation, developed by the teaching teams at ORSYS Formation. Any reproduction, representation, adaptation or use, in whole or in part, without the prior written authorisation of ORSYS, is strictly prohibited. ORSYS reserves the right to take any action necessary to protect its intellectual property rights.

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 : 20 Oct.

2027 : 2 Nov., 2 Nov.

PARIS LA DÉFENSE
2026 : 20 Oct.



This programme is an original creation, developed by the teaching teams at ORSYS Formation. Any reproduction, representation, adaptation or use, in whole or in part, without the prior written authorisation of ORSYS, is strictly prohibited. ORSYS reserves the right to take any action necessary to protect its intellectual property rights.