Question

C++

This program will compare sorting algorithms by examining how the number of swaps/exchanges differs between the two algorithms, and demonstrate the exchanges visually.

This program will repeat until the user elects to quit.

Ask the user how large of an array they'd like to create and fill with random numbers. The range of array elements they can select is between 5 and 20 inclusive. Use input validation on this 5-20 range. The range of random numbers is 0-99 inclusive.

The array that you create must be declared of the size that the user enters, not some arbitrary large number.

Pass your array to a function that will populate it with the random numbers.

Your program must call a function that you create for each of these sort functions, and you pass the array to it. Use the code we've already seen in class for these sort functions. Modify your sort functions such that these features/functionalities are added:

• Add code to keep a count of how many exchanges/swaps take place to accomplish the sort. Remember, for bubble sort, there are many swaps that occur. For select sort, there are fewer. Your code should reflect these properties of the sorts. Display the results at the end.
• Add code to print out the array contents after each pass of the sort. This creates the sorting visualization.

Your results should very closely resemble:

This program will create an array of random numbers of a size that
you specify. It will sort the array using both the Bubble and
Select sort algorithms. Next it will visualize the sorting process
and display the number of sorting exchanges that took place in each.

How large of an array would you like? Choose between 5-20: 10

Bubble Sort of this array: 
96 87 45 49 83 69 89 21 17 52

Sorting visualization:
87 96 45 49 83 69 89 21 17 52
87 45 96 49 83 69 89 21 17 52
87 45 49 96 83 69 89 21 17 52
87 45 49 83 96 69 89 21 17 52
87 45 49 83 69 96 89 21 17 52
87 45 49 83 69 89 96 21 17 52
87 45 49 83 69 89 21 96 17 52
87 45 49 83 69 89 21 17 96 52
87 45 49 83 69 89 21 17 52 96
45 87 49 83 69 89 21 17 52 96
45 49 87 83 69 89 21 17 52 96
45 49 83 87 69 89 21 17 52 96
45 49 83 69 87 89 21 17 52 96
45 49 83 69 87 21 89 17 52 96
45 49 83 69 87 21 17 89 52 96
45 49 83 69 87 21 17 52 89 96
45 49 69 83 87 21 17 52 89 96
45 49 69 83 21 87 17 52 89 96
45 49 69 83 21 17 87 52 89 96
45 49 69 83 21 17 52 87 89 96
45 49 69 21 83 17 52 87 89 96
45 49 69 21 17 83 52 87 89 96
45 49 69 21 17 52 83 87 89 96
45 49 21 69 17 52 83 87 89 96
45 49 21 17 69 52 83 87 89 96
45 49 21 17 52 69 83 87 89 96
45 21 49 17 52 69 83 87 89 96
45 21 17 49 52 69 83 87 89 96
21 45 17 49 52 69 83 87 89 96
21 17 45 49 52 69 83 87 89 96
17 21 45 49 52 69 83 87 89 96

Select Sort of this array: 
96 87 45 49 83 69 89 21 17 52

Sorting visualization:
17 87 45 49 83 69 89 21 96 52
17 21 45 49 83 69 89 87 96 52
17 21 45 49 83 69 89 87 96 52
17 21 45 49 83 69 89 87 96 52
17 21 45 49 52 69 89 87 96 83
17 21 45 49 52 69 89 87 96 83
17 21 45 49 52 69 83 87 96 89
17 21 45 49 52 69 83 87 96 89
17 21 45 49 52 69 83 87 89 96

Number of exchanges:
Bubble: 31
Select: 9

Another visualization (Y/N)? > n
Program ending. Bye!

Answer 1

Code

#include<iostream>
#include<time.h>
using namespace std;
void populateArray(int a[],int len)
{
   srand (time(NULL));
   for(int i=0;i<len;i++)
   {
       a[i]=rand() % 100;
   }
}
void printArray(int a[],int len)
{
   for(int i=0;i<len;i++)
   {
       cout<<a[i]<<" ";
   }
   cout<<endl;
}
int bubleSort(int array[],int len)
{
   int i, j, temp;
int swaps = 0;
for(i = 0; i < len-1; ++i)
   {
for(j=0; j<len-1-i; ++j)
       {
if(array[j] > array[j+1])
           {
temp = array[j+1];
array[j+1] = array[j];
array[j] = temp;
               printArray(array,len);
swaps++;
}
}
}
return swaps;
}
void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}
  
int selectionSort(int arr[], int n)
{
int i, j, min_idx,swapCount=0;
  
// One by one move boundary of unsorted subarray
for (i = 0; i < n-1; i++)
{
// Find the minimum element in unsorted array
min_idx = i;
for (j = i+1; j < n; j++)
if (arr[j] < arr[min_idx])
min_idx = j;
  
// Swap the found minimum element with the first element
swap(&arr[min_idx], &arr[i]);
       swapCount++;
       printArray(arr,n);
}
   return swapCount;
}
int main()
{
   int arraySize;
   int *array;
   char choice;
   while(true)
   {
       while(true)
       {
           cout<<"How large of an array would you like? Choose between 5-20:";
           cin>>arraySize;
           if(arraySize>=5 && arraySize<=20)
               break;
           else
           cout<<"Invalid size! Try again."<<endl;
       }
       array=new int[arraySize];
       populateArray(array,arraySize);

      
       cout<<"Bubble Sort of this array: "<<endl;
       printArray(array,arraySize);
       cout<<endl<<endl;
       int numberofSwapsBuble=bubleSort(array,arraySize);
       cout<<"\nSelct Sort of this array: "<<endl;
       printArray(array,arraySize);
       cout<<endl<<endl;
       int numberOfSwapsSelection=selectionSort(array,arraySize);
       cout<<"\nNumber of exchanges:\nBubble: "<<numberofSwapsBuble<<endl;
       cout<<"Select: "<<numberOfSwapsSelection<<endl<<endl;
       cout<<"Another visualization (Y/N)? > ";
       cin>>choice;
       if(choice=='n')
           break;
   }
   cout<<"Program ending. Bye!"<<endl<<endl;
   return 1;
}

outputs

If you have any query regarding the code please ask me in the comment i am here for help you. Please do not direct thumbs down just ask if you have any query. And if you like my work then please appreciates with up vote. Thank You.