dl511ir/usaa25
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Update du3/program.c

Browse Source
This commit is contained in:
Denis Landa 2025-10-16 17:09:56 +00:00
parent 9770be8838
commit c10fc52f48
1 changed files with 14 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
du3/program.c
View File

@ -9,14 +9,14 @@ struct listok {
float cena;
};
int add_listok(struct listok *p, int *n) {
if (fgets(p[*n].nazov, 101, stdin) == NULL) {
int add_listok(struct listok *p, int *n){
if (fgets(p[*n].nazov, 101, stdin) == NULL){
return 0;
}
p[*n].nazov[strcspn(p[*n].nazov, "\n")] = 0;
if (scanf("%f", &p[*n].cena) != 1) {
if (scanf("%f", &p[*n].cena) != 1){
return 0;
}
@ -25,20 +25,20 @@ int add_listok(struct listok *p, int *n) {
return 1;
}
int compare(struct listok *a, struct listok *b) {
if (a->cena > b->cena) {
int compare(struct listok *a, struct listok *b){
if (a->cena > b->cena){
return 1;
}
if (a->cena < b->cena) {
if (a->cena < b->cena){
return -1;
}
return strcmp(a->nazov, b->nazov);
}
void sort_listok(struct listok *p, int n) {
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (compare(&p[i], &p[j]) > 0) {
void sort_listok(struct listok *p, int n){
for (int i = 0; i < n - 1; i++){
for (int j = i + 1; j < n; j++){
if (compare(&p[i], &p[j]) > 0){
struct listok tmp = p[i];
p[i] = p[j];
p[j] = tmp;
@ -47,18 +47,18 @@ void sort_listok(struct listok *p, int n) {
}
}
void print_listok(struct listok *p, int n) {
for (int i = 0; i < n; i++) {
void print_listok(struct listok *p, int n){
for (int i = 0; i < n; i++){
printf("%s\n", p[i].nazov);
printf("%f\n", p[i].cena);
}
}
int main() {
int main(){
struct listok p[LIST_SIZE];
int n = 0;
while (add_listok(p, &n)) {
while (add_listok(p, &n)){
}
sort_listok(p, n);