Question

Implement Insertion Sort and collect data regarding number of key comparisons and data moves for a small list of 10 integer values. You must try a sorted list, a descending list, and a random list.

c++ please

Answer 1

#include <iostream>
#include <cstdlib>
#include <ctime>

using namespace std;

int main(){
   int size = 10;
   int* arr = new int(size);
   for(int i = 0;i<size;i++){
      arr[i] = rand()%100;
   }
   
   cout<<"Random array: ";
    for(int i = 0;i<size;i++){
       cout<<arr[i]<<" ";
   }
   cout<<endl;
    
   int i, j, key, swapCount = 0, comparisionCount = 0;
       for (i = 1; i < size; i++) 
    {  
        key = arr[i];  
        j = i - 1;
        while (j >= 0 && arr[j] < key) 
        {  
           swapCount++;
           arr[j + 1] = arr[j];  
            j = j - 1;  
            comparisionCount+=2;
        }  
        comparisionCount+=2;
        swapCount++;
        arr[j + 1] = key;  
    }  
    
    cout<<"Sorted array: ";
    for(i = 0;i<size;i++){
       cout<<arr[i]<<" ";
   }
   cout<<endl;
    cout<<"Number of comparisions: "<<comparisionCount<<endl;
   cout<<"Number of swaps: "<<swapCount<<endl;    
    return 0;
}