Q: Integrate time function in insertion sort code and check time for 50,100 and 250 value
Q: Integrate time function in insertion sort code and check time for 50,100 and 250 values
Question: Inserting Sort
#include<iostream>
using namespace std;
//swapping
void swapping(int &a, int &b)
{
//variable declaration
int temp;
//swapping
temp = a;
a = b;
b = temp;
}
//to display the array
void display(int *array, int s)
{
//Loop
for(int x = 0; x<s; x++)
//Creating the array
cout << array[x] << " ";
cout << endl;
}
//Performing the selectionSort
void selectionSort(int *array, int s)
{
//variable declaration
int x, j, min;
//loop
for(x = 0; x<s-1; x++)
{
//used to minimum data
min = x;
for(j = x+1; j<s; j++)
if(array[j] < array[min])
min = j;
//placing the value
swap(array[x], array[min]);
}
}
//main of the code
int main()
{
//variable declaration
int n;
//input
cout << "Enter the number of elements: ";
//Storing the input
cin >> n;
//Creating array
int arr[n];
//Asking for the array value
cout << "Enter elements:" << endl;
//loop
for(int x = 0; x<n; x++)
{
cin >> arr[x];
}
//Prints the array before sorting
cout << "Array before Sorting: ";
display(arr, n);
//Prints the array after sorting
selectionSort(arr, n);
cout << "Array after Sorting: ";
display(arr, n);
}
Step by step
Solved in 3 steps with 1 images
