Advertisement
sigalNotovich

Untitled

Feb 6th, 2016
123
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.75 KB | None | 0 0
  1. #include <stdlib.h>
  2. #include <stdio.h>
  3.  
  4.  
  5. typedef struct {
  6. char dname[30];/*department name*/
  7. char mname[20];/*menegare name*/
  8. long phone;/*phone of mazkirute*/
  9.  
  10. }department;
  11.  
  12. typedef struct {
  13. int numofworker;
  14. int expiriensyears;
  15. department departmant;
  16. }employee;
  17.  
  18.  
  19.  
  20. typedef struct node_s {
  21. struct node_s * next;
  22. employee data;
  23. }Node;
  24.  
  25. typedef struct {
  26. Node * head;
  27. Node * tail;
  28. }List;
  29.  
  30. List * buildlist(List* ptrlist);
  31.  
  32. /*building one sharsheret memuienet shel employee*/
  33. main() {
  34. List * ptrnew=(List*)malloc(sizeof(List));
  35. Node* current1=NULL, *current2=NULL, *current3 = NULL;
  36. List* ptr1 = NULL;
  37. ptr1 = buildlist(ptr1);
  38.  
  39. List* ptr2 = NULL;
  40. ptr2 = buildlist(ptr2);
  41.  
  42. current1 = ptr1->head;
  43. current2 = ptr2->head;
  44.  
  45. if ((current1->data.numofworker) < (current2->data.numofworker)) {
  46. ptrnew->head = current1;
  47. current1 = current1->next;
  48. }
  49. else if((current2->data.numofworker) < (current1->data.numofworker)) {
  50. ptrnew->head = current2;
  51. current2 = current2->next;
  52. }
  53. else if((current1->data.numofworker) == (current2->data.numofworker)) {
  54. ptrnew->head = current1;
  55. current1 = current1->next;
  56. current2 = current2->next;
  57. }
  58. current3 = ptrnew->head;
  59.  
  60. do {
  61. if ((current1->data.numofworker) < (current2->data.numofworker)) {
  62. current3->next = current1;
  63. current1 = current1->next;
  64. }
  65. else if ((current2->data.numofworker) < (current1->data.numofworker)) {
  66. current3->next = current2;
  67. current2 = current2->next;
  68. }
  69. else if ((current1->data.numofworker) == (current2->data.numofworker)) {
  70. current3 -> next= current1;
  71. current1 = current1->next;
  72. current2 = current2->next;
  73. }
  74. current3 = current3->next;
  75.  
  76. } while ((current1!=ptr1->head)||(current2 != ptr2->head));
  77. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement