├── CreateTeam.c
└── README.md


/CreateTeam.c:
--------------------------------------------------------------------------------
 1 | #include<stdio.h>
 2 | /*
 3 | 	changes from previous version:
 4 | 	 1- player capacity: from 6 to infinity
 5 | 	 2- 20 lines less code
 6 | 	 3- 5 less definitions
 7 | 	
 8 | 	future changes:
 9 | 	 1- uneven number of matches
10 | 	 2- set score criteria
11 | */
12 | struct player{
13 | 	char name[20];
14 | 	int height;
15 | 	int weight;
16 | 	int point;
17 | 	int score;
18 | };
19 | 
20 | main() {
21 | 	
22 | 	int i,j,size=1;
23 | 
24 | 	while(size%2==1) {
25 | 		printf("(even) total number of players: ");
26 | 		scanf("%d",&size);
27 | 	}
28 | 	
29 | 	struct player players[size];
30 | 	
31 | 	for(i=0;i<size;i++) {
32 | 		printf("(number %d) Name of player: ",i+1);
33 | 		scanf("%s",players[i].name);
34 | 	}
35 | 	
36 | 	for(i=0;i<size;i++) {
37 | 		printf("\n%s\n--------\n",players[i].name);
38 | 		printf("height: ");
39 | 		scanf("%d",&players[i].height);
40 | 		printf("weight: ");
41 | 		scanf("%d",&players[i].weight);
42 | 		printf("last match pointed: ");
43 | 		scanf("%d",&players[i].point);
44 | 		players[i].score = players[i].point*3+players[i].height*2+players[i].weight*1;
45 | 		printf("%s has %d score.\n",players[i].name,players[i].score);
46 | 	}
47 | 	
48 |     for(i=0;i<size;i++) {
49 |         for(j=0;j<size-1;j++) {     // bubble sort
50 |             if(players[j+1].score < players[j].score) {
51 |                 struct player temp = players[j+1];
52 |                 players[j+1] = players[j];
53 |                 players[j] = temp;
54 |             }
55 |         }
56 |     }
57 |     
58 | 	int sumA=0,sumB=0;
59 | 	struct player teamA[size/2],teamB[size/2];
60 | 	teamA[0] = players[0],teamB[0] = players[1];
61 | 	sumA+=players[0].score;
62 | 	sumB+=players[1].score;
63 | 	j=1;
64 | 	
65 | 	for(i=2;i<size-1;i+=2) {
66 | 		if(sumA>sumB) {
67 | 			teamA[j] = players[i];
68 | 			teamB[j] = players[i+1];
69 | 		}
70 | 		else {
71 | 			teamA[j] = players[i+1];
72 | 			teamB[j] = players[i];
73 | 		}
74 | 		j++;
75 | 	}
76 | 	
77 | 	printf("\n\nTeam A:\n");
78 | 	for(i=0;i<size/2;i++) printf("%s\n",teamA[i].name);
79 | 	printf("\n\nTeam B:\n");
80 | 	for(i=0;i<size/2;i++) printf("%s\n",teamB[i].name);
81 | }
82 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # Ideal Team Algorithm
 2 | 
 3 | It is a simple algorithm you can use for sport matches.
 4 | 
 5 |     changes from previous version:
 6 | 	 1- player capacity: from 6 to infinity
 7 | 	 2- 20 lines less code
 8 | 	 3- 5 less definitions
 9 | 	
10 | 	future changes:
11 | 	 1- uneven number of matches
12 | 	 2- set score criteria
13 | 
14 | # How does it work?
15 | 
16 | It chooses the most competitive of all team possibilities:
17 | 
18 | First we get the information of all the players. Then we find the match with the least difference between the two teams out of all team possibilities.
19 | 


--------------------------------------------------------------------------------