Question

Declare an array of integers of size 8 and initialize it with any non-duplicate integer values you like. Don’t enter the values in any order. Print the unsorted array. Sort the array using selection sort or insertion sort in descending order. Print what sort you are using. Write any additional functions that you need for sorting. Keep monitoring the number of comparisons and number of swaps performed while sorting. Report both after sorting. Print the sorted array. in C++

Answer 1

#include <iostream>

using namespace std;

//global variable declaration
int coutSwap = 0;
int countComp = 0;

//function to sort and std::array<T, N> ;
void insertionSort(int array[], int size)
{
//variable declaration
int j, temp;
for (int i = 1; i < size; i++)
{
j = i;
countComp++;
while ((j > 0) && (array[j - 1] < array[j]))
{
if(array[j-1]<array[j])
{
countComp++;
}
temp = array[j - 1];
array[j - 1] = array[j];
array[j] = temp;
j--;
coutSwap++;
}
}
}

int main()
{
//array declaration and initialization
int array[] = {12, 11, 13, 5, 6, 10, 14, 15};
  
//display unsorted array
cout<<endl<<"Unsorted Array: ";
for (int i = 0; i < 8; i++)
cout<<array[i]<<" ";
  
//function calling
insertionSort(array, 8);
  
//display sorted array
cout<<endl<<endl<<"Sorted Array: ";
for (int i = 0; i < 8; i++)
cout<<array[i]<<" ";
  
cout<<endl<<endl<<"No of swaps: "<<coutSwap;
cout<<endl<<"No of comparisions: "<<countComp;
return 0;
}

OUTPUT: