Advertisement
Guest User

Untitled

a guest
Mar 21st, 2018
84
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.23 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. struct Complex{
  4. int real, img;
  5. Complex(){
  6. }
  7. Complex(int r, int i){
  8. real=r;
  9. img=i;
  10. }
  11. void showStruct(){
  12. printf("real,img");
  13. }
  14. };
  15.  
  16. void bubbleSort(Complex* arrayPtr, int length_array) // sortarea prin bule
  17. {
  18. Complex temp; // temporar sa salveze masivul
  19. bool exit = false; // iesire din masiv daca a fost sortat
  20.  
  21. while (!exit) // pina cind masivul nu este sortat
  22. {
  23. exit = true;
  24. for (int int_counter = 0; int_counter < (length_array - 1); int_counter++) // ciclu interior
  25. //sortarea dupa crescator - simbolul >
  26. //sortarea de la descrescator - simbolul <
  27. if (arrayPtr[int_counter].img > arrayPtr[int_counter + 1].img) // cmp a 2 elemente de linga
  28. {
  29. // sortatrea
  30. temp = arrayPtr[int_counter];
  31. arrayPtr[int_counter] = arrayPtr[int_counter + 1];
  32. arrayPtr[int_counter + 1] = temp;
  33. exit = false; // iara sortarea din nou
  34. }
  35. }
  36. }
  37.  
  38. int main() {
  39. Complex mas[5];
  40. int real, img;
  41. for(int i=0;i<5;i++){
  42. scanf("%d %d",&real,&img);
  43. mas[i]=Complex(real, img);
  44. }
  45. printf("\n");
  46. for(int i=0;i<5;i++){
  47. mas[i].showStruct();
  48. }
  49. printf("\n");
  50. bubbleSort(mas,5);
  51. for(int i=0;i<5;i++){
  52. mas[i].showStruct();
  53. }
  54. return 0;
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement