Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- void sortPrezime(position head) //---------SORT PREZIME---------
- {
- position prev_j, j, i, end = NULL;
- end = NULL;
- while (head->next != end)
- {
- i = head;
- prev_j = i->next;
- j = prev_j->next;
- while (j != end)
- {
- if (_strcmpi(prev_j->prez, j->prez) > 0)
- {
- prev_j->next = j->next;
- j->next = prev_j;
- i->next = j;
- }
- i = prev_j;
- prev_j = j;
- j = j->next;
- }
- end = prev_j;
- }
- }
- //-------------------------
- void sortiranjePoGodini(position head) { //----------SORT GODINA------------
- position i, j = NULL;
- int temp = 0;
- for (i = head; i != NULL; i = i->next) {
- for (j = i->next; j != NULL; j = j->next) {
- if (i->god > j->god) {
- temp = i->god;
- i->god = j->god;
- j->god = temp;
- }
- }
- }
- }
- //-----------------------------
- void Presjek(Position L1, Position L2, Position P){ //--------PRESJEK-------------
- Position q;
- while (L1 != NULL && L2 != NULL) {
- if (L1->Element > L2->Element)
- L1 = L1->Next;
- else if (L1->Element < L2->Element)
- L2 = L2->Next;
- else
- {
- q = (Position)malloc(sizeof(Cvor));
- if (q == NULL)
- printf("\r\nGreska!\r\nMemorija nije alocirana.");
- else
- {
- q->Element = L1->Element;
- q->Next = P->Next;
- P->Next = q;
- P = q;
- }
- L1 = L1->Next;
- L2 = L2->Next;
- } } }
- //-----------------------------
- void Unija(Position L1, Position L2, Position U){ //-----UNIJA-----------------------
- Position q, tmp;
- int tmp_element = 0;
- while (L1 != NULL && L2 != NULL)
- {
- if (L1->Element > L2->Element)
- {
- tmp_element = L1->Element;
- L1 = L1->Next;
- }
- else if (L1->Element < L2->Element)
- {
- tmp_element = L2->Element;
- L2 = L2->Next;
- }
- else
- {
- tmp_element = L1->Element;
- L1 = L1->Next;
- L2 = L2->Next;
- }
- q = (Position)malloc(sizeof(Cvor));
- if (q == NULL)
- printf("\r\nGreska!\r\nMemorija nije alocirana.");
- else
- {
- q->Element = tmp_element;
- q->Next = U->Next;
- U->Next = q;
- U = q;
- }
- }
- if (L1 == NULL)
- tmp = L2;
- else
- tmp = L1;
- while (tmp != NULL)
- {
- q = (Position)malloc(sizeof(Cvor));
- if (q == NULL)
- printf("\r\nGreska!\r\nMemorija nije alocirana.");
- else
- {
- q->Element = tmp->Element;
- q->Next = U->Next;
- U->Next = q;
- U = q;
- }
- tmp = tmp->Next;
- }
- }
- //-----------------------------
- void uzimanjeSuglasnike(position head, position head2) { //----------------UZIMANJE SAMOGLASNIKA--------------------
- head = head->next;
- position temp = NULL;
- while (head != NULL) {
- if (imaSamoglasnika(head)==0 ) {
- temp = createNode();
- strcpy(temp->rijeci, head->rijeci);
- insert(head2, temp);
- }
- head = head->next;
- }
- printf("Samo sa suglasnicima rici:\n");
- printList(head2);
- }
- int imaSamoglasnika(position head) {
- char samoglasnici[5] = { 'a','e','i','o','u' };
- for (int i = 0;i < 5;i++) {
- if (tolower(head->rijeci[0]) == samoglasnici[i])
- return 1;
- }
- return 0;
- }
- //-------------------------------------------------
Add Comment
Please, Sign In to add comment