#include <iostream> using namespace std; // Function to sort the array using bubble sort algorithm. void processBubbleSort(int arr[], int n) { // Your code here int length =n; bool swapped = true; while(swapped){ swapped = false; for (int i=0 ; i<length-1 ; i++){ if(arr[i] > arr[i+1]){ swapped = true; int largeElement = arr[i]; arr[i] = arr[i+1]; arr[i+1] = largeElement; } } length = length-1; } } void displayArray(int arr[], int n) { for (int i = 0; i < n; i++) { cout << arr[i] << " "; } cout << endl; } // Function to dynamically allocate an array and fill it with random values. void fillDynamicArrayWithRandomValues(int** arr, int* n) { cout << "Enter the size of the array: "; cin >> *n; *arr = new int[*n]; srand(time(0)); // Seed for random number generation for (int i = 0; i < *n; i++) { (*arr)[i] = rand() % 1000; // Fill with random numbers between 0 and 999 } } int main() { int* arr; int n; fillDynamicArrayWithRandomValues(&arr, &n); cout << "Unsorted array: "; displayArray(arr, n); processBubbleSort(arr, n); cout << "Sorted array: "; displayArray(arr, n); delete[] arr; // Deallocate dynamically allocated memory return 0; }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter