| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | i&m: add purple circles exercise | Santo Cariotti | 2021-02-12 | 3 | -0/+13 |
| | | |||||
| * | i&m: add exercise | Santo Cariotti | 2021-02-12 | 3 | -0/+15 |
| | | |||||
| * | databases: xml exercise | Santo Cariotti | 2021-02-09 | 4 | -0/+84 |
| | | |||||
| * | databases: add xml exercise | Santo Cariotti | 2021-02-06 | 3 | -0/+100 |
| | | |||||
| * | databases: ex 3 | Santo Cariotti | 2021-02-06 | 2 | -2/+18 |
| | | |||||
| * | course: databases | Santo Cariotti | 2021-02-06 | 4 | -0/+72 |
| | | |||||
| * | conf: rename | Santo Cariotti | 2021-02-06 | 109 | -0/+0 |
| | | |||||
| * | feat: variant of heapsort in rust | Santo Cariotti | 2020-10-23 | 1 | -0/+115 |
| | | |||||
| * | fix: heapsort must be with max-heap | Santo Cariotti | 2020-10-23 | 1 | -29/+10 |
| | | |||||
| * | Merge branch 'master' of https://github.com/dcariotti/unict | Santo Cariotti | 2020-10-20 | 0 | -0/+0 |
| |\ | |||||
| | * | chore: name of first year folder | Santo Cariotti | 2020-10-18 | 108 | -1/+0 |
| | | | |||||
| * | | chore: name of first year folder | Santo Cariotti | 2020-10-20 | 108 | -4/+15 |
| |/ | |||||
| * | feat: add heap in c | Santo Cariotti | 2020-10-18 | 1 | -0/+103 |
| | | |||||
| * | Update cbrt.cc | Santo Cariotti | 2020-08-19 | 1 | -0/+13 |
| | | | | alternative way, more easy | ||||
| * | Update pow.cc | Santo Cariotti | 2020-08-19 | 1 | -19/+10 |
| | | | | better solution with O(n) | ||||
| * | Create cbrt.cc | Santo Cariotti | 2020-08-18 | 1 | -0/+24 |
| | | |||||
| * | Update sqrt.cc | Santo Cariotti | 2020-08-18 | 1 | -0/+8 |
| | | | | alternative way to calculate square root | ||||
| * | feat: add exercises of 20/07/2020 exam | Santo Cariotti | 2020-07-20 | 5 | -0/+964 |
| | | |||||
| * | chore: binary search | Santo Cariotti | 2020-07-19 | 1 | -0/+33 |
| | | |||||
| * | chore: new algorithms | Santo Cariotti | 2020-07-19 | 3 | -0/+97 |
| | | |||||
| * | feat: add graph in c++ with list and all algorithms | Santo Cariotti | 2020-07-17 | 1 | -0/+221 |
| | | | | | BFS, DFS, topological sort, SSC | ||||
| * | feat: add algorithms | Santo Cariotti | 2020-07-14 | 2 | -0/+88 |
| | | |||||
| * | feat: topological sort | Santo Cariotti | 2020-07-01 | 1 | -0/+212 |
| | | |||||
| * | fix: quicksort r index | Santo Cariotti | 2020-07-01 | 1 | -1/+1 |
| | | |||||
| * | feat: add dfs | Santo Cariotti | 2020-06-29 | 1 | -0/+191 |
| | | |||||
| * | chore: remove swp file | Santo Cariotti | 2020-06-29 | 1 | -0/+0 |
| | | |||||
| * | chore: add bfs | Santo Cariotti | 2020-06-26 | 1 | -0/+186 |
| | | |||||
| * | chore: add exercise | Santo Cariotti | 2020-06-24 | 1 | -0/+151 |
| | | |||||
| * | feat: add graph with matrix instead of list | Santo Cariotti | 2020-06-24 | 1 | -0/+81 |
| | | |||||
| * | chore: new exercise | Santo Cariotti | 2020-06-22 | 2 | -0/+66 |
| | | |||||
| * | feat: add stack and queue implemented with an array | Santo Cariotti | 2020-06-20 | 2 | -0/+116 |
| | | |||||
| * | feat: add exam 08/10/2014 | Santo Cariotti | 2020-06-09 | 1 | -0/+202 |
| | | |||||
| * | feat: add exercise | Santo Cariotti | 2020-06-08 | 1 | -0/+20 |
| | | | | | Count number of ones in a number | ||||
| * | fix: remove useless files | Santo Cariotti | 2020-06-04 | 4 | -253/+0 |
| | | |||||
| * | feat: add graph | Santo Cariotti | 2020-05-29 | 1 | -0/+164 |
| | | |||||
| * | fix: remove bin file | Santo Cariotti | 2020-05-29 | 1 | -0/+0 |
| | | |||||
| * | chore: order in coding contest folder | Santo Cariotti | 2020-05-29 | 17 | -0/+361 |
| | | |||||
| * | feat: add more exercises | Santo Cariotti | 2020-05-24 | 3 | -0/+346 |
| | | |||||
| * | fix: queue and stack push/pop | Santo Cariotti | 2020-05-24 | 2 | -18/+8 |
| | | |||||
| * | feat: add exercises | Santo Cariotti | 2020-05-24 | 9 | -0/+429 |
| | | |||||
| * | feat: binary search tree | Santo Cariotti | 2020-05-14 | 1 | -0/+225 |
| | | |||||
| * | fix: return node removed stack and queue | Santo Cariotti | 2020-05-14 | 2 | -9/+17 |
| | | |||||
| * | fix: research for list double linked | Santo Cariotti | 2020-05-14 | 2 | -25/+20 |
| | | | | | It uses prev pointer instead of a new linear search | ||||
| * | fix: improve code quality for data structures | Santo Cariotti | 2020-05-13 | 6 | -205/+179 |
| | | |||||
| * | chore: move algorithms file into self directory | Santo Cariotti | 2020-05-10 | 2 | -4/+4 |
| | | |||||
| * | feat: stack data structure | Santo Cariotti | 2020-05-10 | 1 | -0/+66 |
| | | |||||
| * | feat: queue data structure | Santo Cariotti | 2020-05-10 | 1 | -0/+74 |
| | | |||||
| * | feat: add ram manipulation exercises | Santo Cariotti | 2020-05-10 | 2 | -0/+66 |
| | | |||||
| * | fix: search function | Santo Cariotti | 2020-05-09 | 3 | -0/+45 |
| | | |||||
| * | feat: double circular linked list | Santo Cariotti | 2020-05-09 | 1 | -0/+210 |
| | | |||||
