Программа по поиску наименьшего по модулю элемента матрицы не работает корректно

#include <iostream>
#include <math.h>
#include <time.h>
#define SIZE 10
using namespace std;
void user_matrix(short A[][SIZE], short r, short c);
void rand_matrix(short A[][SIZE], short r, short c);
void output(short A[][SIZE], short r, short c);
short min_el(short A[][SIZE], short r, short c);
void new_matrix(short A[][SIZE], short r, short c, short min);
 
short main() {
    short A[SIZE][SIZE], r, c, choice;
    cout << "input row"<< endl;
    cin >> r;
    cout << "input col"<< endl;
    cin >> c;
    cout << "1 - by user, 2 - by random" << endl;
    cin >> choice;
    switch (choice) {
    case 1: user_matrix(A, r, c);
    case 2: rand_matrix(A, r, c);
    }
    output(A, r, c);
    short min = min_el(A, r, c);
    //cout << "min el =" << min << endl;
    cout << min_el(A, r, c) << endl;
    cout << "new matrix" << endl;
    new_matrix(A, r, c, min_el(A,r,c) );
    return 0;
}
 
void user_matrix(short A[][SIZE], short r, short c) {
    for (short i = 0; i < r; i++) 
        for (short j = 0; j < c; j++) 
            cin >> A[i][j];
    return;
}
 
void rand_matrix(short A[][SIZE], short r, short c) {
    srand((unsigned)time(NULL));
    for (int i = 0; i<r; i++)
        for (int j = 0; j<c; j++)
            A[i][j] = rand() % (r*c) - rand() % (r*c);
    return;
 
}
 
void output(short A[][SIZE], short r, short c) {
    for (short i = 0; i < r; i++) {
        for (short j = 0; j < c; j++)
            cout << A[i][j] << '\t';
        cout << endl;
    }
    return;
}
 
short min_el(short A[][SIZE], short r, short c) {
    short min = A[0][0];
    for (short i = 0; i < r; i++) {
        for (short j = 0; j < c; j++) {
            if (fabs(A[i][j]) < min) min= fabs(A[i][j]);
        }
    }
    return min;
}
 
void new_matrix(short A[][SIZE], short r, short c, short min) {
    short element = min;
    for (short i = 0; i < r; i++)
        for (short j = 0; j < c; j++)
            element = element - A[i][j];
    for (short i = 0; i < r; i++) {
        for (short j = 0; j < c; j++)
            cout << element << '\t';
        cout << endl;
    }
}

short min = fabs(A[0][0]);

    short min = A[0][0];
    for (short i = 0; i < r; i++) {
        for (short j = 0; j < c; j++) {
            if (fabs(A[i][j]) < fabs(min)) min= A[i][j];
        }
    }
    return min;