-
Notifications
You must be signed in to change notification settings - Fork 40
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Integrate the array exercises into po4a properly (and refresh them)
- Loading branch information
Showing
14 changed files
with
381 additions
and
42 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,18 @@ | ||
<h1>Valeur moyenne</h1> | ||
|
||
|
||
<p>L'objectif de cet exercice est de calculer la valeur moyenne d'un tableau de | ||
valeur entière.</p> | ||
|
||
<p>Vous devez donc remplir le corps de la méthode <code>average(int[] | ||
tab)</code> qui prend en paramètre le tableau, et qui retourne en résultat | ||
la valeur moyenne. Notez bien que le résultat de cette méthode est de type | ||
<code>int</code></p> | ||
|
||
<p>Pour calculer la valeur moyenne d'un tableau, il faut parcourir l'ensemble | ||
des valeurs du tableau, en faire la somme (vous aurez donc besoin d'une | ||
variable pour conserver le résultat intermédiaire), puis diviser cette somme | ||
par le nombre de valeur contenu dans le tableau. On vous rappelle que vous | ||
pouvez obtenir la taille d'un tableau <code>montableau</code> en consultant | ||
la valeur de l'attribut <code>length</code> de ce tableau (autrement dit | ||
<code>montableau.length</code>).</p> |
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,19 @@ | ||
<h1>Indice de la valeur maximale</h1> | ||
|
||
<p>Dans cet exercice, vous devez calculer l'indice de la case contenant la plus | ||
grande valeur du tableau.</p> | ||
|
||
<p>Pour cela, remplissez la méthode <code>indexOfMaximum(int[] tab)</code> dont | ||
le | ||
paramètre est le tableau à explorer. Si jamais la plus grande des valeurs du | ||
tableau est répétée plusieurs fois, votre méthode doit renvoyer la position | ||
de | ||
la première occurence.</p> | ||
|
||
<p>Pour résoudre cet exercice, vous devez parcourir le tableau. Pour chaque | ||
case, | ||
si sa valeur est plus grande que la plus grande des valeurs que vous avez | ||
rencontré jusque là, sauvegardez cette nouvelle championne et sa | ||
position. Il | ||
vous faut donc deux nouvelles variables; la valeur initiale de la championne | ||
pourrait être la valeur rangée dans la première case.</p> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1 +1,11 @@ | ||
<h1>Index of the maximum value</h1> | ||
|
||
<p>In this exercise, you must compute the indice of the tab cell containing the biggest value.</p> | ||
|
||
<p>For that, fill the <code>indexOfMaximum(int[] tab)</code> method. Its parameter is the array to | ||
explore. Should the array contain the searched value | ||
several times, you should return the indice of the first occurrence.</p> | ||
|
||
<p>To solve this exercise, you should sweep over the whole array. For each value, if it's bigger | ||
than the biggest value you saw so far, you must save this new champion and its position. | ||
You will thus need 2 extra variables; the initial value of the champion could be the value of the first cell.</p> |
Oops, something went wrong.