Matrisalar bilan ishlashga doir turli dasturlar

# include # include # include # include void main ( ) { srand ( time (0)); int a[ 3 ][ 3 ], b[ 3 ][ 3 ], c[ 3 ][ 3 ], i, j, k; for (i = 0; i < 3; i++) for (j = 0; j < 3; j++) a[ i ][ j ] = rand ( ); for (i = 0; i < 3; i++) for (j = 0; j < 3; j++) b[ i ][ j ] = rand ( ); // davomi keyingi varaqda

for (i=0; i<3; i++) { for (j=0; j<3; j++) { c [ i ][ j ] = 0; for (k=0; k < 3; k++) c[ i ][ j ] = c[ i ][ j ] + a[ i ] [ k ] * b[ k ][ j ]; cout <<”c=” << c[ i ][ j ] << ”\t”; } cout << endl; } getch ( ); }

5-masala. A matrisani B vektorga ko’paytirish dasturini tuzing. Izoh: matrisaning satrlari soni vektorning satrlariga teng bo’lishi kerak.

(xatosini toping!) # include # include # include void main ( ) { int a[3][3] = {{1,2,3},{4,5,6},{7,8,9}}, b[3] = {1,3,6}, i, j; for ( i=0; i < 3; i++) { for ( j=0; j < =3; j++) c[ i ] = c[ j ] + a[ j ][ i ] * b[ j ]; cout <<”c=”<< c[ j ] << endl; } getch ( ); }

# include # include //# include void main ( ) { int a[3][3] = {{1,2,3},{4,5,6},{7,8,9}}, b[3] = {1,3,6}, c[3], i, j; for ( i=0; i < 3; i++) { c[i] = 0; for ( j=0; j < 3; j++) c[ i ] = c[ i ] + a[ i ][ j ] * b[ j ]; cout <<”c=”<< c[ i ] << endl; } getch ( ); }

Saralash masalasi. Saralash deb massiv elementlarini o’sish yoki kamayish tartibida joylashtirishga aytiladi. Saralashning bir nechta usullari mavjud. 1. Tanlash usuli. Bu usulda massiv elementlari ichidan kichigiga (kattasiga) nisbatan solishtirish orqali amalga oshiriladi. Izoh: dasturini avval bir o’lchovli massiv uchun, keyin 2 o’lchovli massiv uchun ko’rib chiqamiz.

# include # include void main() { int a[5]={4,7,10,-20,-6}, i, j, min, b; for (i = 0; i < 5; i++) {min = i; for (j = i+1; j < 5; j++) if ( a[j] > a[min] ) min = j; b = a[i]; a[i] = a[min]; a[min] = b;} for(i = 0; i < 5; i++) cout<<"a="<< a[i] << endl; getch(); }