Nadeen Udantha
2018-05-18 ae9fb2abbd8e2b7e079b56bf1cf39754d7c091ac
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;
            }