Aktualizovat du2/program.c

du2/program.c

@@ -6,16 +6,18 @@
 
 #define SIZE 128
 
-int najdi_studenta(struct student* students,int size, const char* name);
+int compare(const void* p1, const void* p2);
+
+struct student {
+  int pocetHlasov;
+  char meno[SIZE];
+};
 
 int main() {
 
-    //pomocne premeny
+    //citanie vstupu
-    struct student databaza[SIZE];
-    memset(databaza,0,SIZE*sizeof(struct student));
-    int size = 0;
     char line[SIZE];
-    memset(line,0,SIZE);
+    memset(line,0, sizeof(name));
     char* r = fgets(line,SIZE,stdin);
 
     if (r == NULL)
@@ -23,61 +25,66 @@ int main() {
         printf("Chyba: Zlyhalo nacitavanie vstupu.\n");
     }
 
-    char* konecPtr = NULL;
+    //helper/pomocne lok. premeny
-    char meno[SIZE];
+    char najdMeno [32];
-    memset(meno,0,SIZE);
+    int najdPocetHlasov = 0;
-    char* zaciatokMena = konecPtr + 1;
 
+    //array instancii struktur studentov
+    struct student DBStudenti[20];
 
-    int size_mena = strlen(zaciatokMena) - 1;
+    //prednastavenie pamati
-    if (size_mena > 0)
+    memset(student, 0, sizeof(student));
+
+    //pomocny index
+    int x = 0;
+
+    //spracovanie inputu, vycitavanie najdenych mien a najdenych poctov hlasov z retazca
+    while (sscanf(line, "%d %s", &najdPocetHlasov, najdMeno) != -1)
     {
-        memcpy(meno,zaciatokMena,size_mena);
+        // DBStudenti[x].meno = najdMeno;
-    }
+        // DBStudenti[x].pocetHlasov = najdPocetHlasov;
-    else 
+        strcpy(DBStudenti[x].meno, najdMeno);
-    {
+        strcpy(DBStudenti[x].pocetHlasov, najdPocetHlasov);
-        printf("Chyba: Nepodarilo sa nacitat meno.\n");
+        x += 1;
+
+        //reset nacitanych hodnot na konci kazdeho cyklu
+        memset(najdMeno, 0, SIZE);
+        najdPocetHlasov = 0;
     }
 
-    int value = strtol(line,&konecPtr,10);
+    //zoradenie zoznamu, resp. arrayu
-    if (value == 0)
+    qsort(DBStudenti, 20, sizeof(struct student), compare);
+
+    //vypis vysledkov
+    printf("Vysledky:\n");
+    for (int i = 0; i < 20; i++)
     {
-        printf("Chyba: Zlyhala premena vstupu.\n");
+        //20 je nahodne cislo, resp. realne budeme vypisovat userov
+        //, pokial nenarazime na prazdny student ID zaznam
+        if (DBStudent[i].meno == '\0')
+        {
+            break;
         }
-    int id = find_student(databaza,size,meno);
+        //malo by vypisovat zaznamy takto: 
-    if (id < 0)
+        //10_Tomas_Vlcek
-    {
+        printf("%d %s", DBStudent[i].pocetHlasov, DBStudent[i].meno);
-        memcpy(databaza.name,meno,velkost_mena);
-        size+=1;
-    }
-    else
-    {
-        s1.votes += 1;
     }
     return 0;
 }
 
-int najdi_studenta(struct student* students,int size, const char* name)
+    int compare(const void* p1, const void* p2)
-{
-    for (int i = 0; i < size, i++)
-    {
-        if (struct student databaza[i] == name)
-        {
-            return i;
-        }
-    }
-    return -1;
-}
-
-struct student
-{
-    char name[SIZE];
-    int votes;
-};
-int komparator(const void* p1, const void* p2)
     {
+        //casting, resp. premena dat. typu pointerov na ich spravny typ
+        //nakolko qsort() pozaduje od porovnavaciej funkcie, aby akceptovala pointery s lubovolnym dat. typom (const void*)
         struct student *s1 = (struct student *)p1;
         struct student *s2 = (struct student *)p2;
 
-    return 0;
+        if (s1->pocetHlasov == s2->pocetHlasov)
+        {
+            //vrati lexikografciky zorad. instancie v poli
+            return strcmp(s2->meno, s1->meno);
+        }
+
+        //vrati zaznamy zorad. zostupne
+        return s2->pocetHlasov - s1->pocetHlasov;
     }