Insertion sorting using pointers and function

This C++ code demonstrates the implementation of the insertion sort algorithm using pointers and functions. Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is efficient for small datasets but not suitable for large ones due to its O(n^2) time complexity.

Code Explanation:

#include <iostream>
using namespace std;

void insertionSort(int *p, int size);
void insertionSort(int *p, int size)
{
    int i, j, temp;
    for (i = 1; i < size; i++)
    {
        temp = p[i];
        j = i - 1;
        while (j >= 0 && p[j] > temp)
        {
            p[j + 1] = p[j];
            j--;
        }
        p[j + 1] = temp;
    }
    for (i = 0; i < size; i++)
    {
        cout << p[i] << " ";
    }
}

int main()
{
    int n;
    int *p;
    cout << "Enter the number of elements you want to store in an array:" << endl;
    cin >> n;
    p = new int[n];
    cout << "Now enter the values:" << endl;
    for (int i = 0; i < n; i++)
    {
        cin >> p[i];
    }
    insertionSort(p, n);
}
    

Frequently Asked Questions (FAQs):

1. What is insertion sort?

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It iterates through an array, comparing each element with the ones before it and shifting elements to the right until the correct position for the current element is found.

2. Why is insertion sort used in this code?

Insertion sort is used in this code to demonstrate a sorting algorithm. While not the most efficient sorting algorithm for large datasets, it is easy to understand and implement, making it suitable for educational purposes.

3. What are pointers used for in this code?

Pointers are used to dynamically allocate memory for an integer array and to pass arrays to functions. In this code, a pointer (p) is used to create an array of integers, and this array is then passed to the insertionSort function using the pointer.