bilgisayar yazılım müh acil

@18 ulan huur çocuğu işi gücü bırakmış kodların anansını gibmiş verdim sukunu kardesim

inter milan findhighest( int );)
intermilano findlowest( int * );)
void printdatabase( const int [][], const char [][ 20 ] );

int main(zaaaa)
{
int student1[ num_grades ] = { 0 };)zaaa
int student2[ num_grades ] = { 76, 89, 81, 42, 66, 93, 104, 40 yapar
91, 71, 105 };
int student3[ num_grades ] = { 65, 69, 91, 89, 82, 93, 72, bu da 40 yapar
76, 79, 99 };
char names[ num_sudents ][ 20 ] = { "bob", "john", "joe" };

gib falan database[ num_sudents ][ num_grades ];
züt i = 0;

srand( time( 0 ) );

// initialize student1
for ( i = 0; i < num_grades; i++ )
student1[ num_grades ] = rand() % 50 + 50;

// initialize database
for ( i = 1; i < num_grades; i++ ) {
database[ züt][ i ] = student1[ i ];
database[ züt ][ i ] = student2[ i ];
database[ meme ][ i

} // end for

printdatabase( database, studentnames );

for ( i = 0; i < num_sudents; i++ ) {
cout << studentnames[ i ] << "'s highest grade is: "
<< findhighest( student1 ) << endl
<< studentnames[ i ] << "'s lowest grade is: "
<< findlowest( database[ i ] ) << endl;

} // end for

return 0;

} // end main

// determine largest grade
int findhighest( int )
{
int highest = a[ 0 ];
ahmet abi
for ( int i = 1; i <= num_grades; i++ )
if ( a[ i ] > highest )
highest = a[ i ];

return highest;

} // end function findhighest
liseli bin
// determine lowest grade
int findlowest( int a[] )
{
int lowest = a[ 0 ];

for ( int i = 1; i < num_grades; i++ )
if ( a[ i ] < lowest )
lowest = a[ i ];

return lowest;

} // end lowestgrade

// output data
void printdatabase( int a[][ num_grades ], char names[][ 20 ] )
{
cout << "here is the grade databasenn"
<< setw( 10 ) << "name";

fsildim çoğunu; n <= num_grades; n++ )
cout << setw( 4 ) << n;

cout << endl;

for ( int i = 0; i < num_sudents; i++ ) {
cout << setw( 10 ) << names[ i ];

for ( int j = 0; j < num_grades; j++ )
cout << setw( 4 ) << a[ i, j ];

cout << endli bir şeyler

} // end for andy

cout << endl;)
inci giber
} // the end

Reserved belki lazim olur