Advertisement
Guest User

Untitled

a guest
Mar 17th, 2018
82
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.64 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int sortowanie(int tablica[], int n)
  6. {
  7. int funkcja;
  8.  
  9. for(int i=1; i<=n; i++)
  10. for(int j=n-1; j>=i; j--)
  11. {if (tablica[j] < tablica[j-1])
  12. {
  13. funkcja= tablica[j-1];
  14. tablica[j-1]=tablica[j];
  15. tablica[j]=funkcja;
  16. }
  17.  
  18. }
  19.  
  20. return tablica[n-2];
  21. }
  22.  
  23. int main ()
  24. {
  25. int n,i,tablica[10];
  26. n=10;
  27.  
  28. for(int i=0; i<n; i++)
  29. {
  30. cin >> tablica[i];
  31. }
  32.  
  33. cout<<sortowanie(tablica,n)<<endl;
  34.  
  35. /*
  36. cin >> n;
  37.  
  38. for (int i=0; i<n ;i++)
  39. {
  40. cin >> tablica[i];
  41. }
  42. cout << tablica[n-2] <<endl;*/
  43. return 0;
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement