first/matrix_swap.cpp at master · Ly1Nazar/first · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
#include <stdio.h>
#include <math.h>
#define N 100
#define M 100


double swap(double* xp, double* yp)
{
	double temp = *xp;
	*xp = *yp;
	*yp = temp;
	return 0;
}

// A function to implement bubble sort
void bubbleSort(double arr[], int m)
{
	int i, j;
	for (i = 0; i < m - 1; i++)

		// Last i elements are already in place
		for (j = 0; j < m - i - 1; j++)
			if (arr[j] > arr[j + 1])
				swap(&arr[j], &arr[j + 1]);
}

int switch_col(double* marked,int m, double a[N][M],int n) {
	double tempor[N][M];
	for (int i = 0; i < m; i++) {
		int position = marked[i];
		for (int j = 0; j < n; j++) {
			tempor[j][i] = a[j][position];
		}
	}
	for (int i = 0; i < m; i++) {
		printf("\n");
		for (int j = 0; j < n; j++) {
			printf("%lf",tempor[i][j]);
		}
	}
	return 0;
}


int swap(double a[N][M],int n,int m,double x[N]) {
	double copy_x[N];
	//i have two arrays copy x stores original array &x aftrer func bublesort sorted numbers
	for (int i = 0; i < m; i++) {
		copy_x[i] = x[i];
	}
	bubbleSort(x, m);
	for (int i = 0; i < m; i++) {
		printf("x =%lf", x[i]);
	}
	double marked_list[N];
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < m; j++) {
			if (x[i] == copy_x[j]) {
				marked_list[j] = i;
			}
		}
	}
	for (int i = 0; i < m; i++) {
		printf("marked list\n");
		printf("%lf", marked_list[i]);
	}
	switch_col(marked_list, m, a,n);
	return 0;


}


int matrix_min_col(double a[N][M], int n, int m) {
	//running through collumns
	double x[N], min;
	//i - arrays, j - col
	for (int i = 0; i < m; i++) {
		min = a[0][i];
		for (int j = 0; j < n; j++) {
			if (a[j][i] < min) {
				min = a[j][i];
			}
		}
		x[i] = min;
	}
	for (int i = 0; i < n; i++) {
		printf("\n x = %lf ", x[i]);
	}
	swap(a, n, m, x);
	return 0;
}


int matrix_inp(int n,int m,double a[N][M]) {
	int b;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			printf("row=%d column=%d input value\n", i, j);
			scanf_s("%d", &b);
			a[i][j] = b;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			printf("%lf ", a[i][j]);
		}
		printf("\n");
	}
	return 0;
}


int main() {
	int n, m ;
	printf("number of arrays =");
	scanf_s("%d", &n);
	printf("number of columns =");
	scanf_s("%d", &m);
	double a[N][M];
	matrix_inp(n, m, a);
	matrix_min_col(a,n,m);

}