Question

void AList. Bubble Sort PRE: the N O. AList is valid. POST: the N o. AList is unchanged, except that its elements are now in ascending order for (in t i 0; i size 1; i++) for (int j 0; j size 1 i; j++) if (items j] items j 1]) Swap (j, j 1) else

code is in c++......please can u rewrite the code such that in the postconditions, the elements will now be in descending order

Answer 1

#include <stdio.h>

#include <math.h>

#include <stdlib.h>

#include <time.h>

#include<iostream>

using namespace std;

void bubbleSort(int* number, int n){

int temp;

for(int i = 1; i < n; i++) {

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

if(number[j] < number[j+1]) {

temp = number[j];

number[j] = number[j+1];

number[j+1] = temp;

}

}

}

}

void printArray(int* number, int n) {

for(int i = 0; i < n; ++i) {

cout << number[i] <<" ";

}

printf("\n");

}

void swap(int *x , int *y){

int temp = *x ;

*x = *y;

*y = temp;

}

void randomizeArray(int* number, int n) {

srand(10);

for(int i = 0; i < n; ++i) {

int r = rand()%n;

swap(&number[i],&number[r]);

}

}

int main(){

int n =10;

int arr[n];

int temp = n;

for(int i = 0; i < n; ++i) {

arr[i] = temp--;

}

cout<<"Before Sort"<<endl;

randomizeArray(arr, n);

printArray(arr,n);

cout<<"After Sort"<<endl;

bubbleSort(arr, n);

   printArray(arr,n);

printf("--------------------\n");

printf("\n");

return 0;

}

====
See Output



I did in descending, If u want ascending do let me know

c4b301bb9697:Chegg kundrar$ vi Bubble.cpp c4b301bb9697:Chegg kundrar$ g++ Bubble.cpp c4b301bb9697:Chegg kundrar$ ./a.out Before Sort 6 89 7 5 4 10 1 3 2 After Sort 109 8 7 65 4 3 2 1 c4b301bb9697:Chegg kundrars