Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <conio.h>
- #define I 4
- #define J 6
- inline int minStrOfMatrix(float matrix[I][J]);
- inline void bobleSort(float *C);
- inline void matrixOutput(float matrix[I][J]);
- int main(){
- float A[I][J],C[I][J],B[I][J];
- for(int i =0;i<I;i++)
- for(int j=0;j<J;j++){
- printf("Input element number %iX%i\n",i+1,j+1);
- scanf("%f",&A[i][j]);
- if(i>=j)
- C[i][j]=B[i][j]=i+3+1;
- else
- C[i][j]=B[i][j]=j-1;
- }
- int min,rub;
- if(( min = minStrOfMatrix(B))==(rub=minStrOfMatrix(A))){
- for(int i = 0;i<I;i++){
- for(int j = 0;j<J;j++){
- C[i][j]=A[i][j];
- }
- }
- }
- bobleSort(C[min-1]);
- printf("Min str of A is %i\n",rub);
- printf("Min str of B is %i\n",min);
- printf("Matrix B is:\n");
- matrixOutput(B);
- printf("\nMatrix C is:\n");
- matrixOutput(C);
- getch();
- return 0;
- }
- inline int minStrOfMatrix(float matrix[I][J]){
- int strNum;
- int min;
- min = matrix[0][0];
- for(int i=0;i<I;i++)
- for(int n=0;n<J;n++)
- if(matrix[i][n]<min){
- min=matrix[i][n];
- strNum = i;
- }
- return strNum+1;
- }
- inline void bobleSort(float *C){
- bool exit = false;
- while(!exit){
- exit =true;
- for(int j = 0;j<J-1;j++)
- if(C[j]<C[j+1]){
- int temp=C[j];
- C[j]=C[j+1];
- C[j+1]=temp;
- exit = false;
- }
- }
- }
- inline void matrixOutput(float matrix[I][J]){
- for(int i = 0;i<I;i++){
- for(int j =0;j<J;j++)
- printf("%.1f\t",matrix[i][j]);
- printf("\n");
- }
- }
Add Comment
Please, Sign In to add comment