summary |
shortlog | log |
commit |
commitdiff |
tree
first ⋅ prev ⋅ next
Jérôme Benoit [Tue, 14 Feb 2017 22:08:06 +0000 (23:08 +0100)] 
.gitignore: do not try to be smart for now
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
Jérôme Benoit [Tue, 14 Feb 2017 22:05:50 +0000 (23:05 +0100)]
.gitignore: ignore the binary built INSIDE the exo? dir
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
Jérôme Benoit [Tue, 14 Feb 2017 21:50:42 +0000 (22:50 +0100)]
sortFirst(): only change the return value once, not at every iteration
when a permutation is done.
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
Jérôme Benoit [Tue, 14 Feb 2017 21:41:11 +0000 (22:41 +0100)]
.gitignore: ignore the default binary's name Makefile output
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
Jérôme Benoit [Tue, 14 Feb 2017 21:35:05 +0000 (22:35 +0100)]
Implement exo1.c completly:
* Add user prompt for the array values;
* Optimize sortArray() values inversion loop;
* Beautify a bit the terminal output.
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
Jérôme Benoit [Sun, 12 Feb 2017 19:32:02 +0000 (20:32 +0100)]
exo1: swap, no need to declare tmp variable if values are the same
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
Jérôme Benoit [Sat, 11 Feb 2017 21:20:10 +0000 (22:20 +0100)]
Initial commit of Polytech'Marseille tutorial C exercices
* Introduce an exercice solution skeleton with a basic
Makefile and piece of C elementary structure file.
* Preliminary work on tutorial's exercice one :
- add void swap(int* v1, int* v2); function;
- add void displayArray(int* array, int count) function;
- add bool sortFirst(int* array, int length) function;
* Document a bit the usage in the README file.
Signed-off-by: Jérôme Benoit <jerome.benoit@piment-noir.org>
repositories / TD_C.git / log
