mirror of
				https://github.com/ASDjonok/OOP_IO-2x_2023.git
				synced 2025-10-31 15:09:24 +02:00 
			
		
		
		
	update lab2
This commit is contained in:
		
							parent
							
								
									f385bff73d
								
							
						
					
					
						commit
						399941844f
					
				| @ -2,17 +2,17 @@ public class Lab2 { | |||||||
|     public static void main(String[] args) { |     public static void main(String[] args) { | ||||||
|         final int A = 2; |         final int A = 2; | ||||||
|         final int[][] MATRIX_B = { |         final int[][] MATRIX_B = { | ||||||
|                 {1, 202, 3,1, 202, 3,1, 202, 3,}, |                 {1, 202, 1, 1, 202, 3, 1, 202, 3,}, | ||||||
|                 {202, 3,1, 202, 3,1, 202, 3,}, |                 {1, 202, 1, 1, 202, 3, 1, 202, 3,}, | ||||||
|                 {3,1, 202, 3,1, 202, 3,}, |                 {1, 1,   3, 1, 202, 3, 1, 202, 3,}, | ||||||
|                 {4, 5, 6,}, | //                {4, 5, 6,}, | ||||||
|         }; |         }; | ||||||
| 
 | 
 | ||||||
|         int[][] MATRIX_C = multiplication(A, MATRIX_B); |         int[][] MATRIX_C = multiplication(A, MATRIX_B); | ||||||
| 
 | 
 | ||||||
|         print(MATRIX_C); |         print(MATRIX_C); | ||||||
| 
 | 
 | ||||||
|         System.out.println("Sum of smallest elements in every column:" + sumOfSmallestElementsInEveryColumn(MATRIX_C)); |         System.out.println("Sum of smallest elements in every column: " + sumOfSmallestElementsInEveryColumn(MATRIX_C)); | ||||||
| 
 | 
 | ||||||
|         /*int[] array = {1, 2, 3}; |         /*int[] array = {1, 2, 3}; | ||||||
|         int[] array2 = new int[3]; |         int[] array2 = new int[3]; | ||||||
| @ -63,11 +63,13 @@ public class Lab2 { | |||||||
| 
 | 
 | ||||||
|     private static int sumOfSmallestElementsInEveryColumn(final int[][] MATRIX_C) { |     private static int sumOfSmallestElementsInEveryColumn(final int[][] MATRIX_C) { | ||||||
| //        todo check different length of rows | //        todo check different length of rows | ||||||
|  | //        todo try to change i and j | ||||||
|  | //        todo check repetition of minimal elements | ||||||
|         int sum = 0; |         int sum = 0; | ||||||
|         for (int i = 0; i < MATRIX_C[0].length; i++) { |         for (int i = 0; i < MATRIX_C[0].length; i++) { | ||||||
|             int tmpSmallest = MATRIX_C[0][i]; |             int tmpSmallest = MATRIX_C[0][i]; | ||||||
|             for (int j = 1; j < MATRIX_C.length; j++) { |             for (int j = 1; j < MATRIX_C.length; j++) { | ||||||
|                 if (tmpSmallest < MATRIX_C[j][i]) { |                 if (MATRIX_C[j][i] < tmpSmallest) { | ||||||
|                     tmpSmallest = MATRIX_C[j][i]; |                     tmpSmallest = MATRIX_C[j][i]; | ||||||
|                 } |                 } | ||||||
|             } |             } | ||||||
|  | |||||||
		Loading…
	
	
			
			x
			
			
		
	
		Reference in New Issue
	
	Block a user