summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2020-05-24feat: add exercisesSanto Cariotti
2020-05-14feat: binary search treeSanto Cariotti
2020-05-14fix: return node removed stack and queueSanto Cariotti
2020-05-14fix: research for list double linkedSanto Cariotti
It uses prev pointer instead of a new linear search
2020-05-13fix: improve code quality for data structuresSanto Cariotti
2020-05-10chore: move algorithms file into self directorySanto Cariotti
2020-05-10feat: stack data structureSanto Cariotti
2020-05-10feat: queue data structureSanto Cariotti
2020-05-10feat: add ram manipulation exercisesSanto Cariotti
2020-05-09fix: search functionSanto Cariotti
2020-05-09feat: double circular linked listSanto Cariotti
2020-05-08feat: circulat listSanto Cariotti
2020-05-03fix: pop w valueSanto Cariotti
2020-05-03feat: double linked listSanto Cariotti
2020-05-03fix: list, print and removeSanto Cariotti
2020-05-02feat: singular listSanto Cariotti
2020-04-19feat: add coding contest 18/04/2020Santo Cariotti
2020-04-18feat: cc 17/04/2020 tastevinSanto Cariotti
2020-04-18feat: condig contest 17/04/2020Santo Cariotti
2020-04-05feat: add coding contest 05/04/2020Santo Cariotti
2020-04-05feat: add coding contest 04/04/2020Santo Cariotti
2020-04-02fix: tab identation for dcdSanto Cariotti
2020-04-02fix: tab indentationSanto Cariotti
2020-04-02feat: vector product in asmSanto Cariotti
2020-04-02feat: count numbers of occurences in asmSanto Cariotti
2020-04-02feat: find element into an array in asmSanto Cariotti
2020-04-02feat: lowest num in asmSanto Cariotti
2020-04-02feat: biggest num in asmSanto Cariotti
2020-04-01feat: sum n numbers for ASMSanto Cariotti
2020-04-01feat: division operation for ASMSanto Cariotti
2020-04-01feat: multiply operation for ASMSanto Cariotti
2020-03-28feat: coding contest 28/03/20Santo Cariotti
2020-03-28feat: coding contest 27/03/20Santo Cariotti
2020-03-26feat: quicksort algorithmSanto Cariotti
2020-03-26mergesort: fix size of temp arraySanto Cariotti
2020-03-26feat: mergesort algorithmSanto Cariotti
2020-03-21feat: coding contest 21/03/20Santo Cariotti
2020-03-20feat: coding contest 20/03/20Santo Cariotti
2020-02-09chore: ex D lab15/2/19Santo Cariotti
2020-02-09chore: ex C lab 28/2/19Santo Cariotti
2020-02-04fix: improve template security with its specializationSanto Cariotti
2020-02-03chore: lab exam 14/12/18Santo Cariotti
2020-02-02lab 03/07/19 BSanto Cariotti
2020-02-01chore: lab exam A 28/2/19Santo Cariotti
2020-02-01chore(rename): lab test bSanto Cariotti
2020-02-01chore: lab exam 28/2/19Santo Cariotti
2020-01-27ex 27/1/20Santo Cariotti
2020-01-27ex 1 27/01/20Santo Cariotti
2020-01-26ex2 6/12/18Santo Cariotti
Scrivere un metodo che prenda in input tre parametri formali: una matrice di puntatori a stringhe A di dimensioni n × m, uno short k ed una stringa s. Il metodo restituisca un array di bool di dimensione n in cui il singolo elemento di indice i assume valore true se la stringa s `e sottostringa di almeno k stringhe della riga i-esima della matrice A.
2020-01-26Ex 1 6/12/18Santo Cariotti
Scrivere un metodo che prenda in input un parametro formale matrice A di interi di dimensioni n × n ed un double w, e restituisca un valore booleano true se esiste almeno una colonna della matrice A per cui il rapporto tra la somma degli elementi della colonna stessa e la somma degli elementi della diagonale principale di A sia maggiore di w.
generated by cgit v1.2.3-18-g5258 (git 2.32.0) at 2024-11-10 11:03:44 +0000