| Age | Commit message (Collapse) | Author | Files | Lines | |
|---|---|---|---|---|---|
| 2015-12-15 | Finish report practical 2HEADmaster | Camil Staps | 8 | -23/+53 | |
| 2015-12-11 | Finish first version report practical 2 | Camil Staps | 7 | -74/+110 | |
| Some changes were made to the code and the Makefile to clean up, make it more in line with the algorithm as described in the report, etc. No significant changes. | |||||
| 2015-12-10 | round_profit instead of round_ct | Camil Staps | 1 | -16/+14 | |
| 2015-12-10 | Start report practical 2 | Camil Staps | 3 | -0/+199 | |
| 2015-12-10 | Faster implementation, test enhancement Practical2 | Camil Staps | 3 | -18/+17 | |
| Tester strings are padded nicely. Implementation uses less memory and is faster with -Ofast. | |||||
| 2015-12-09 | Removed Java Practical2; moved C to main directory | Camil Staps | 5 | -100/+2 | |
| 2015-12-09 | Working solution Practical 2, small fixes | Camil Staps | 3 | -30/+44 | |
| - Makefile: less dependent on program name - test.sh: quote variables - checkout.c: almost completely new algorithm. This one actually works. At least it does on the test cases. | |||||
| 2015-12-08 | Test cases practical 2 | Camil Staps | 44 | -7/+67 | |
| 2015-11-30 | C version practical2 | Camil Staps | 3 | -3/+85 | |
| 2015-11-30 | Practical2 seems to work | Camil Staps | 3 | -5/+44 | |
| 2015-11-28 | start practical 2 | Camil Staps | 7 | -0/+96 | |
 |
index : NWI-IBC027-Algoritmen-Datastructuren | |
| Files related to NWI-IBC027 Algoritmen en Datastructuren, autumn 2015, Radboud University Nijmegen. |
| aboutsummaryrefslogtreecommitdiff |
path: root/Practical2