The coordination of the PLM translations is done on Discord: https://discord.gg/HTPpveu (channel #translation)

Component Translated Unfinished Unfinished words Unfinished characters Untranslated Checks Suggestions Comments
Missions and exercises GPL-3.0 99% 5 157 806 3 563 0 0
PLM engine GPL-3.0 0 0 0 0 16 0 0
Glossary Programmer's Learning Machine GPL-3.0 0 0 0 0 0 0 0

Overview

Project website github.com/BuggleInc/PLM
Instructions for translators

The Programmer's Learning Machine is a free cross-platform programming exerciser. It lets you explore various concepts of programming through interactive challenges, that you can solve in either Java, Python or Scala.

The PLM is known to work on all major operating systems (Linux, Mac, Windows). Its interface and content is thoughtfully translated to English and French, and partially to Brazilian and Italian; we hope that other translations will be contributed in the future.

Over 200 challenges are provided so far, ranging from a complete programming introduction for real beginners to more advanced topics such as recursion or sorting algorithms and to programming brain teasers.

Translation and development is organized on Discord: https://discord.gg/HTPpveu
Project maintainers User avatar mquinson
Language French
Language code fr
Text direction Left to right
Number of speakers 295,510,923
5 days ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 2,180 45,211 283,739
Translated 99% 2,175 99% 45,054 99% 282,933
Needs editing 1% 2 1% 135 1% 689
Read-only 0% 0 0% 0 0% 0
Failing checks 26% 579 37% 16,922 41% 118,432
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 1% 3 1% 22 1% 117
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes
Nov Dec Jan Feb Mar Apr May Jun Jul Aug Sep Oct

Quick numbers

45,211
Hosted words
2,180
Hosted strings
99%
Translated
0
Contributors
and previous 30 days

Trends of last 30 days

—
Hosted words
+100%
—
Hosted strings
+100%
—
Translated
+99%
—
Contributors
—
User avatar Umeaboy

Resource updated
The “l10n/engine/fr.po” file was changed. 3 years ago
User avatar liimee

Resource updated
The “l10n/missions/fr.po” file was changed. 3 years ago
User avatar None

Source string changed
For each i in [1,len-1] # Cell 0 is already sorted when considered alone
store the value of i in a variable v
copy the cell i-1 into i if i-1 contains a value bigger than v
copy the cell i-2 into i-1 if i-2 contains a value bigger than v
copy the cell i-3 into i-2 if i-3 contains a value bigger than v
copy the cell i-4 into i-3 if i-4 contains a value bigger than v
...
copy v into the last cell copied above
3 years ago
User avatar None

Source string changed
This sorting algorithm is quite simple to understand and write, even if it is not as efficient as possible. Its asymptotic complexity is in O(n2²), but it is more efficient in practice (linear in best case, ie when the array is already sorted, and N2/4 on average).
3 years ago
User avatar mquinson

Translation changed
Donald Shell propose <code>len/2</code> as initial value of the gap, and then to divide it by 2 at each step. The pseudo-code is thus the following:
Donald Shell propose d'utiliser <code>lgr/2</code> comme première valeur de l'écartement, puis de le diviser par deux à chaque étape. Le pseudo-code est donc le suivant :
3 years ago
User avatar mquinson

Translation changed
This algorithm is named after its author, Donald Shell, who published it in 1959. It can be seen as an application of the CombSort idea (let elements having a long path to travel take shortcuts) to the insertion sort (CombSort is a variation of BubbleSort). Instead of comparing adjacent values during the insertion sort, it compares values separated by a bigger gap. The bigger the gap, the faster the elements are moved to their final destination, but also the less precise is this move. It is thus mandatory to apply the algorithm with a serie of decreasing gaps. At the last step, when the gap is one, InsertionSort is used, but onto an array which is almost already sorted by previous steps.
Cet algorithme porte le nom de son auteur, Donald Shell, qui l'a publié en 1959. Son principe peut être vu comme une application de l'idée du CombSort (faire prendre des raccourcis aux éléments ayant beaucoup de chemin à faire) au tri par insertion (le CombSort est une variante du tri à bulle). Au lieu de comparer les valeurs adjacentes lors du tri par insertion, on compare des valeurs séparées par un <i>écart</i> plus grand. Plus l'écart est grand et plus les éléments sont déplacés rapidement vers leur position finale, mais aussi plus le déplacement est imprécis. Il faut donc appliquer l'algorithme avec une séquence d'écarts décroissante vers un. Ainsi, à la dernière étape quand l'écart vaut un, on applique l'algorithme de tri par insertion de base, mais sur un tableau déjà presque trié par les étapes précédentes.
3 years ago
User avatar mquinson

Translation changed
There is other variations over the insertion sort, such as PatienceSort which builds piles of values and sort each pile afterward. This algorithm presents a 0(n log(n)) timing worst case and a 0(n) space complexity. LibrarySort (proposed in 2004) also trades a bit space in exchange for time since it provide a time complexity of O(n log(n)) but needs to store some more data.
Il existe d'autres variantes du tri par insertion, comme PatienceSorting, qui fait des paquets des valeurs et trie ensuite chaque paquet. Cet algorithme présente un pire cas en O(nlog n), et une complexité spatiale en O(n). LibrarySort (proposé en 2004) échange également un peu d'espace pour du temps puisqu'il présente une complexité moyenne en O(n log n), mais nécessite de stocker des données supplémentaires.
3 years ago
User avatar mquinson

Translation changed
Naturally, you should use a loop to write the big permutation within the given loop. Writing it this way would be really ... counter-productive.
Bien entendu, il faut utiliser une boucle pour écrire la grosse permutation circulaire au cœur de la boucle. L'écrire explicitement de la sorte serait vraiment ... contre-productif.
3 years ago
User avatar mquinson

Translation changed
The idea is to traverse all elements of the array, and to insert each of them into its proper position in the already sorted part of the array. When we look at an element x, the situation is the following: any elements to the left of the array are already sorted, and we have to insert x at its position in the array.
L'idée est de parcourir tous les éléments du tableau, et d'insérer chacun à sa place dans la partie du tableau déjà triée. Lorsque l'on regarde un élément x du tableau, on est dans la situation suivante : tous les éléments à gauche du tableau sont déjà triés, et il faut insérer x à sa place dans le tableau.
3 years ago
User avatar mquinson

Translation changed
This lesson allows to experiment with some classical sorting algorithms (and some less common variant of them). The goal is two fold: you can first better understand the idea of these algorithms by writing them yourself. But even if you don't code the algorithms, you can use the demo mode to organize "races" between these algorithms to experiment in practice what the different asymptotical complexity mean.
Cette leçon vous permet d'expérimenter avec les algorithmes de tri classiques (et certaines optimisations moins courantes de ceux-ci). L'objectif est double: il s'agit tout d'abord de mieux comprendre le principe de ces algorithmes en les codant vous-même. Mais même si vous ne codez pas les algorithmes, vous pouvez utiliser le mode démo pour organiser des "courses" entre ces algorithmes afin d'expérimenter en pratique ce qu'implique la différence de complexité asymptotique entre deux algorithmes.
3 years ago
Browse all changes for this language