eolymp
bolt
Try our new interface for solving problems
Problems

Bubble sort

published at 2/19/17, 6:40:58 pm

Уточните какие числа в масиве

published at 3/25/18, 12:12:00 pm

В мене якась крива бульбашка -_-

published at 4/18/18, 11:51:06 pm

нерозумію, чому 85%? ніби бульбашка правильна -_-

published at 11/20/21, 4:43:04 pm

Судя по всему уникальность элементов не гарантируется.

published at 2/23/24, 8:15:16 am

/////////////////////For CHakals

include <iostream>

using namespace std; void put_arr(int [],int ); void bubble_sort(int[] ,int ); int main() {

int n; cin>>n; int a[n];

for(int i=0;i<n;i++)cin>>a[i];

//put_arr(a,n);//unsorted bubble_sort(a,n); //put_arr(a,n);//sorted

} void put_arr(int arr[],int size ){for(int i=0;i<size;i++)cout<<arr[i]<<" "; cout<<endl;};

void bubble_sort(int arr[],int size ){ int say=0; for(int i=0;i<size;i++){ bool unswapped=true;

            for(int j=0;j<size-i-1;j++)
            if(arr[j]>arr[j+1]){
            swap(arr[j],arr[j+1]);
                say++;
                unswapped=false;    }



            if(unswapped)break;


    }
cout<<say;

};

published at 2/23/24, 8:16:18 am

///////////////////////////////////For Horsefather

include <iostream>

using namespace std;

int main() { int n; cin >> n; int arr[n];

for (int i = 0; i < n; i++) {
    cin >> arr[i];
}

int swapCount = 0; 


for (int i = 0; i < n - 1; i++) {
    for (int j = 0; j < n - i - 1; j++) {
        if (arr[j] > arr[j + 1]) {

            int temp = arr[j];
            arr[j] = arr[j + 1];
            arr[j + 1] = temp;
            swapCount++;
        }
    }
}

cout << swapCount << endl;

return 0;

}