Question

Write a program that creates three identical arrays,list1,list2, and
list3, of 5000 elements. The program then sortslist1using bubble sort,
list2using selection sort, andlist3using insertion sort, and outputs
the number of comparisons and item assignments made by each sorting
algorithm.
Submit a screen shot testing with 20 numbers, 500 numbers, 1000 numbers. Show the output of the arrays of 20 so you can see they are in order. please use c++

Answer 1

//C++ code

#include<iostream>
#include<stdlib.h>
#include<time.h>
using namespace std;

void selectionSort(int a[],int n , int &comp , int &assign){
   int min;
   for(int i=0;i<n-1;i++){
       min=i;
       for(int j=i+1;j<n;j++){
           if(a[j]<a[min])min=j;
           comp++;
       }
       if(min!=i){
           int temp=a[i];
           a[i]=a[min];
           a[min]=temp;
           assign+=3;
       }
   }
}
void bubbleSort(int a[],int n, int &comp , int &assign){
   for(int i=n-1;i>=0;i--){
       for(int j=0;j<i;j++){
           if(a[j]>a[j+1]){
               int temp=a[j];
               a[j]=a[j+1];
               a[j+1]=temp;
               assign+=3;
           }
           comp++;
       }
   }
}

void insertionSort(int a[],int n, int &comp , int &assign){
   for(int i=1;i<n;i++){
       int j=i-1,val=a[i];
       assign++;
       while(j>=0 && a[j]>val){
           comp++;
           a[j+1]=a[j];
           assign++;
           j--;
       }
       a[++j]=val;
       assign++;
   }
}

int main(){
   int size = 5000 ;
   int num , comparison , assign;
   int list1[size] , list2[size],list3[size];
  
   srand(time(NULL));
  
   for(int i=0;i<size;i++){
       num = rand()%size;
       list1[i] = num;
       list2[i] = num;
       list3[i] = num;
   }
  
   comparison = 0;
   assign = 0;
   bubbleSort(list1 , size , comparison , assign);
   cout<<"Sorting List1 using Bubble sort\n";
   cout<<"Number of comparisons: "<<comparison<<endl;
   cout<<"Number of assignments: "<<assign<<endl;
  
   comparison = 0;
   assign = 0;
   selectionSort(list2 , size , comparison , assign);
   cout<<"\nSorting List2 using Selection sort\n";
   cout<<"Number of comparisons: "<<comparison<<endl;
   cout<<"Number of assignments: "<<assign<<endl;
  
   comparison = 0;
   assign = 0;
   insertionSort(list3 , size , comparison , assign);
   cout<<"\nSorting List3 using Insertion sort\n";
   cout<<"Number of comparisons: "<<comparison<<endl;
   cout<<"Number of assignments: "<<assign<<endl;
  
   return 0;
}