Question

Please write in c++ will rate thank you
11 Bubble Sort Goal: order the array from smallest to largest Loop through the entries -If the current value is greater than the next one, swap them If ANY swaps happened, need to loop through all over again!

Answer 1

#include <iostream>

#include<time.h>

using namespace std;

void swap(int *a, int *b)

{

int temp = *a;

*a = *b;

*b = temp;

}

void bubbleSort(int numbers[], int n)

{

int i, j;

for (i = 0; i < n-1; i++)   

for (j = 0; j < n-i-1; j++)

if (numbers[j] > numbers[j+1])

swap(&numbers[j], &numbers[j+1]);

}

int main() {

srand(17);

int array[50];

for(int i = 0; i<50; i++)

array[i] = rand();

cout << "array after fill\n";

for(int i = 0; i<50; i++)

cout << array[i] << " ";

cout << endl;

bubbleSort(array, 50);

cout << "arrayAfterBubbleSort\n";

for(int i = 0; i<50; i++)

cout << array[i] << " ";

cout << endl;

}

**Comment for any further queries.