Untitled
unknown
c_cpp
2 years ago
1.2 kB
5
Indexable
#include <stdio.h>
#include <stdlib.h>
int minColIdx( int n, int m, int** tab )
{
int minColIdx = 0;
int minValue = tab[ 0 ][ 0 ];
for( int i = 0; i < n; ++i )
{
for( int j = 0; j < m; ++j )
{
if( tab[ i ][ j ] < minValue )
{
minValue = tab[ i ][ j ];
minColIdx = j;
}
}
}
return minColIdx;
}
int main()
{
int n = 3;
int m = 4;
int** tab = ( int** )malloc( n * sizeof( int* ) );
for( int i = 0; i < n; i++ )
{
tab[ i ] = ( int* )malloc( m * sizeof( int ) );
}
int values[ 3 ][ 4 ] = {
{10, 20, 30, 40},
{5, 60, 70, 80},
{90, 100, 1, 120}
};
for( int i = 0; i < n; ++i )
{
for( int j = 0; j < m; ++j )
{
tab[ i ][ j ] = values[ i ][ j ];
}
}
int result = minColIdx( n, m, tab );
printf( "Indeks kolumny z najmniejszym elementem: %d\n", result );
for( int i = 0; i < n; ++i )
{
free( tab[ i ] );
}
free( tab );
return 0;
}
Editor is loading...
Leave a Comment