Edmond Yoo
2018-09-16 9c2c220c88aff4d0bcbdd5b03b10c6d1a7db56d3
src/matrix.c
@@ -22,8 +22,8 @@
    for(i = 0; i < truth.rows; ++i){
        top_k(guess.vals[i], n, k, indexes);
        for(j = 0; j < k; ++j){
            int class = indexes[j];
            if(truth.vals[i][class]){
            int class_id = indexes[j];
            if(truth.vals[i][class_id]){
                ++correct;
                break;
            }