You will find a small project that I was able to do in class in the second year of BTS, this project aims to use the object-oriented programming as well as understanding the dynamic table.
- Fichier
- Nouveau - Create a new dynamic array of the desired size.
- Données
- Initialiser à n - Initializes all elements of the array to the value n.
- Initialiser à zéro - Initializes all elements of the array to the value 0.
- Initialisation aléatoire - Initializes all elements of the array with a random value.
- Initialiser séquentielle - Initializes all elements of the array sequentially.
- Trier
- Tri à bulles croissant - Sort the items in the array in ascending order.
- Tri à bulles décroissant - Sort the elements of the table in descending order.
- Tableau trier ? - Returns how the array is sorted.
- Rechercher
- Valeur petit - Returns the value of the element of the array with the smallest value.
- Valeur grande - Returns the value of the element of the array with the largest value.
- Indice petit - Returns the index of the array element with the smallest value.
- Indice grand - Returns the index of the array element with the largest value.
- Indice petit depuis pos - Returns the index of the array element with the smallest value from the desired index.
- Indice grand depuis pos - Returns the index of the array element with the largest value from the desired index.
- Permuter
- Insérer valeur - Inserts a new value at the end of the array.
- Inveser tableau - Invert the elements of the array (the first element goes last etc..).
- Supprimer - Delete the element from the array by giving its index.
GitHub @ahmosys · Twitter @ahmosys · Mail ahmosyspro@protonmail.com