-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathprogtest13:2.c
68 lines (56 loc) · 1.81 KB
/
progtest13:2.c
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
/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int porovnej (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main (void)
{
int * numbers, newnum = 0, stopnum, ind;
ssize_t size, cnt = 0, j=0;
if((scanf("%ld%d", &size, &stopnum) != 2) || (size <= 0)){
printf("Invalid input.\n");
return EXIT_FAILURE;
}
numbers = (int *)malloc(size*sizeof(int));
printf("Array size is: %ld\n",size);
do{
if((ind = scanf("%d", &newnum)) == 0){
printf("Invalid input.\n");
free(numbers);
return EXIT_FAILURE;
}
if(ind == EOF){
newnum = stopnum;
}
else{
cnt++;
if(cnt > size){
size += size;
numbers = (int *)realloc(numbers, size*sizeof(int));
printf("New array size is: %ld\n", size);
}
numbers[cnt-1]=newnum;
}
}while(newnum != stopnum);
qsort (numbers, cnt, sizeof(int), porovnej);
for(ssize_t i = cnt; i>0; i--){
printf("[%ld]: %d\n", j, numbers[i-1]);
j++;
}
free(numbers);
return EXIT_SUCCESS;
}