Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- void show(int *a,int n){
- for(int i=0;i<n;i++){
- cout<< a[i]<<" ";
- }
- cout<<endl;
- }
- bool is_sorted(int *a,int n){
- for(int i=0;i<n-1;i++){
- if(a[i]>a[i+1]){
- return false;
- }
- }
- return true;
- }
- void max_to_end(int *a, int n){
- for(int i=0;i<n-1;i++){
- if(a[i]>a[i+1]){
- swap(a[i],a[i+1]);
- }
- }
- }
- void sort(int *a, int n){
- int count = 0;
- while(!is_sorted(a,n)){
- max_to_end(a,n-count);
- count++;
- }
- cout<< count<<endl;
- }
- int main()
- {
- ifstream fin("/home/student/input");
- int n;
- fin>>n;
- int a[n];
- for(int i=0;i<n;i++){
- fin>>a[i];
- }
- show (a,n);
- fin.close();
- sort(a,n);
- show (a,n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement