Advertisement
Guest User

Untitled

a guest
Nov 24th, 2014
170
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.85 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3.  
  4. using namespace std;
  5.  
  6. void show(int *a,int n){
  7. for(int i=0;i<n;i++){
  8. cout<< a[i]<<" ";
  9. }
  10. cout<<endl;
  11. }
  12. bool is_sorted(int *a,int n){
  13. for(int i=0;i<n-1;i++){
  14. if(a[i]>a[i+1]){
  15. return false;
  16. }
  17.  
  18. }
  19. return true;
  20.  
  21. }
  22. void max_to_end(int *a, int n){
  23. for(int i=0;i<n-1;i++){
  24. if(a[i]>a[i+1]){
  25. swap(a[i],a[i+1]);
  26. }
  27. }
  28. }
  29. void sort(int *a, int n){
  30. int count = 0;
  31. while(!is_sorted(a,n)){
  32. max_to_end(a,n-count);
  33. count++;
  34. }
  35. cout<< count<<endl;
  36. }
  37.  
  38.  
  39. int main()
  40. {
  41. ifstream fin("/home/student/input");
  42. int n;
  43. fin>>n;
  44. int a[n];
  45. for(int i=0;i<n;i++){
  46. fin>>a[i];
  47. }
  48. show (a,n);
  49. fin.close();
  50. sort(a,n);
  51. show (a,n);
  52.  
  53. return 0;
  54. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement