Guest User

Untitled

a guest
May 20th, 2018
139
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 6.97 KB | None | 0 0
  1. void sort(int n, int *T)
  2. {
  3. int i=0, j=0, e=0, temp1, temp2, temp3, temp4, temp5, temp6, temp7, temp8, wskaznik;
  4. char help[10], help2[20];
  5. int a,b,c,d;
  6.  
  7. p[n] = (Car*)malloc(sizeof(Car));
  8. r[n][0] = (Service*)malloc(sizeof(Service));
  9. for (i = 0; i<(n); i++)
  10. {
  11. for (j=0; j<(n-1); j++)
  12. {
  13.  
  14. if ((p[j] -> ID) > (p[j+1] -> ID))
  15. {
  16.  
  17. temp1 = p[j+1] -> ID;
  18. p[j+1] -> ID = p[j] -> ID;
  19. p[j] -> ID = temp1;
  20. strcpy(help, p[j+1] -> Mark);
  21. strcpy(p[j+1] -> Mark, p[j] -> Mark);
  22. strcpy(p[j] -> Mark, help);
  23. temp2 = p[j+1] -> model;
  24. p[j+1] -> model= p[j] -> model;
  25. p[j] -> model = temp2;
  26. temp3 = p[j+1] -> mileage;
  27. p[j+1] -> mileage = p[j] -> mileage;
  28. p[j] -> mileage = temp3;
  29. temp4 = p[j+1] -> currentREPAIRS;
  30. p[j+1] -> currentREPAIRS = p[j] -> currentREPAIRS;
  31. p[j] -> currentREPAIRS = temp4;
  32. temp5 = p[j+1] -> archiveREPAIRS;
  33. p[j+1] -> archiveREPAIRS = p[j] -> archiveREPAIRS;
  34. p[j] -> archiveREPAIRS = temp5;
  35. if(T[j] > T[j+1])
  36. {
  37. for(e=0; e<T[j]; e++)
  38. {
  39. r[j][e] = (Service*)malloc(sizeof(Service));
  40. temp6 = r[j+1][e] -> ID;
  41. r[j+1][e] -> ID = r[j][e] -> ID;
  42. r[j][e] -> ID = temp6;
  43. strcpy(help2, r[j+1][e] -> FULLname);
  44. strcpy(r[j+1][e] -> FULLname, r[j][e] -> FULLname);
  45. strcpy(r[j][e] -> FULLname, help2);
  46. temp7 = r[j+1][e] -> repairTIMES;
  47. r[j+1][e] -> repairTIMES = r[j][e] -> repairTIMES;
  48. r[j][e] -> repairTIMES = temp7;
  49. temp8 = r[j+1][e] -> SERVICEhistory;
  50. r[j+1][e] -> SERVICEhistory = r[j][e] -> SERVICEhistory;
  51. r[j][e] -> SERVICEhistory = temp8;
  52. }
  53. /*for(e=T[j+1]; e<T[j];e++)
  54. {
  55. r[j+1][e] = (Service*)malloc(sizeof(Service));
  56. r[j+1][e] -> ID = r[j][e] -> ID;
  57. strcpy(r[j+1][e] -> FULLname, r[j][e] -> FULLname);
  58. r[j+1][e] -> repairTIMES = r[j][e] -> repairTIMES;
  59. r[j+1][e] -> SERVICEhistory = r[j][e] -> SERVICEhistory;
  60. }*/
  61. wskaznik = T[j+i];
  62. T[j+1] = T[j];
  63. T[j] = wskaznik;
  64. }
  65. else
  66. {
  67. for(e=0; e<T[j+1]; e++)
  68. {
  69. r[j][e] = (Service*)malloc(sizeof(Service));
  70. temp6 = r[j+1][e] -> ID;
  71. r[j+1][e] -> ID = r[j][e] -> ID;
  72. r[j][e] -> ID = temp6;
  73. strcpy(help2, r[j+1][e] -> FULLname);
  74. strcpy(r[j+1][e] -> FULLname, r[j][e] -> FULLname);
  75. strcpy(r[j][e] -> FULLname, help2);
  76. temp7 = r[j+1][e] -> repairTIMES;
  77. r[j+1][e] -> repairTIMES = r[j][e] -> repairTIMES;
  78. r[j][e] -> repairTIMES = temp7;
  79. temp8 = r[j+1][e] -> SERVICEhistory;
  80. r[j+1][e] -> SERVICEhistory = r[j][e] -> SERVICEhistory;
  81. r[j][e] -> SERVICEhistory = temp8;
  82. }
  83. /* for(e=T[j]; e<T[j+1];e++)
  84. {
  85. r[j+1][e] = (Service*)malloc(sizeof(Service));
  86. r[j+1][e] -> ID = r[j][e] -> ID;
  87. strcpy(r[j+1][e] -> FULLname, r[j][e] -> FULLname);
  88. r[j+1][e] -> repairTIMES = r[j][e] -> repairTIMES;
  89. r[j+1][e] -> SERVICEhistory = r[j][e] -> SERVICEhistory;
  90. }*/
  91. wskaznik = T[j+i];
  92. T[j+1] = T[j];
  93. T[j] = wskaznik;
  94.  
  95.  
  96. }
  97.  
  98. }
  99. }
  100. }
  101.  
  102.  
  103.  
  104. }
Add Comment
Please, Sign In to add comment