Advertisement
Guest User

Untitled

a guest
Oct 21st, 2019
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.09 KB | None | 0 0
  1. //b
  2. //start sortowania
  3. int n1 = 20, tmp = 0;
  4. do
  5. {
  6. for (int i = 0; i < n1 - 1; i++)
  7. {
  8. if (tab[i] > tab[i + 1])
  9. {
  10. tmp = tab[i];
  11. tab[i] = tab[i + 1];
  12. tab[i + 1] = tmp;
  13.  
  14. }
  15.  
  16. }
  17. n1--;
  18. }while (n1 > 1);
  19.  
  20. //koniec sortowania
  21.  
  22. int z;
  23. for ( z = 0; z < 20; z++)
  24. {
  25. Console.Write(tab[z]+", ");
  26. }
  27. tab[20] = 1;
  28. int l_w = 0, ilosc = 0;
  29. for (int c = 0; c < 20; c++)
  30. {
  31.  
  32. if (tab[c] == tab[c + 1])
  33. {
  34. l_w++;
  35. }
  36. else
  37. {
  38. l_w--;
  39. if (l_w % 2 == 0)
  40. {
  41. l_w = 0;
  42. ilosc++;
  43. }
  44. else
  45. {
  46. l_w = 0;
  47. }
  48. }
  49.  
  50.  
  51. }
  52.  
  53. Console.WriteLine("Ilosc liczb (b): " + ilosc);
  54.  
  55.  
  56.  
  57. }
  58. break;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement