找到數組中最大的數

#include<stdio.h>
int main()
{
    int a[3][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 11, 12 };        //設置數組
    int i, k,max,low,row;            
    max = 0;
    low = 0;
    row = 0;
    for (i = 0; i <= 2;i++)        //循環遍歷數組
    {
        for (k = 0; k <= 3;k++)
        {
            if (a[i][k]>max)        //如果比MAX大就賦值
            {
                low = i;
                row = k;
                max = a[i][k];
            }
        }
    }
    printf("%d\t%d\t%d", max, low, row);

    return 0;
}