Advanced Search

Evidencija životinja, lista polja - Zadatak_1, Strukture podataka

/ Published in: C++
Save to your folder(s)
Evidencija životinja pomoću lista polja

Expand | Embed | Plain Text

Copy this code and paste it in your HTML 
  1. int LocateL(int n,t*list_head)
  2. {
  3.     for(int i=0; i<list_head->kursor; i++)
  4.     {
  5.         if(n==list_head->jedna_zivotinja[i]->sifra)return i;
  6.     }
  7.     return list_head->kursor;
  8. }
  9. void InsertL(z*novi, int k, t*list_head)
  10. {
  11.     if(k>EndL(list_head))
  12.         {
  13.  
  14.         }
  15.     else
  16.     {
  17.         for (int i = EndL(list_head); i > k; i--)
  18.         {
  19.             list_head->jedna_zivotinja[i] = list_head->jedna_zivotinja[i-1];
  20.         }
  21.         list_head->jedna_zivotinja[k] = novi;
  22.         list_head->kursor = list_head->kursor + 1;
  23.     }
  24. }
  25.  
  26.  
  27. struct z
  28. {
  29.     int sifra,dan,mjesec,godina;
  30.     char naziv[60];
  31.     char vrsta[60];
  32.     float cijena;
  33. };
  34.  
  35. struct t
  36. {
  37.     z*jedna_zivotinja[1000];
  38.     int kursor;
  39. };
  40.  
  41. int DeleteL(int k, t*list_head)
  42. {
  43.     k-=1;
  44.     if(k>EndL(list_head)){}
  45.     else
  46.     {
  47.         for(int i=k; i<EndL(list_head); i++)
  48.         {
  49.             list_head->jedna_zivotinja[i]=list_head->jedna_zivotinja[i+1];
  50.         list_head->kursor=list_head->kursor-1;
  51.         return 0;
  52.     }
  53. }
  54. }
  55.  
  56. void DeleteAll(t*list_head)
  57. {
  58.     list_head->kursor=0;
  59. }
  60.  
  61. int NumberL(t*list_head)
  62. {
  63.     int k=list_head->kursor;
  64.     return k;
  65. }
  66.  
  67. z*RetrieveL(int k,t*list_head)
  68. {
  69.     return list_head->jedna_zivotinja[k-1];
  70. }
  71.  
  72. int FirstL(t*list_head)
  73. {
  74.     return 0;
  75. }
  76.  
  77. int EndL(t*list_head)
  78. {
  79.     return list_head->kursor;
  80. }
  81.  
  82. int NextL(int k,t*list_head)
  83. {
  84.     return k+1;
  85. }
  86.  
  87. int PreviousL(int k,t*list_head)
  88. {
  89.     return k-1;
  90. }
  91.  
  92. t*InitL(t*list_head)
  93. {
  94.     t*novi=new t;
  95.     novi->kursor=0;
  96.     return novi;
  97. }

URL: Strukture podataka evidencija zivotinja lista polja

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.