sorting, C++ (gcc)

Language: Layout:

//Microsoft (R) C/C++ Optimizing Compiler Version 19.00.23506 for x86

#include <iostream>

int A[] = {12,2,3,5,7,9,10,43,23,6786,3,3254,789,29};
int N = sizeof(A) / sizeof(A[0]);

void print () 
{
    for (int i=0;i<N;i++)
    {
        std::cout << A[i] << " ";
    }
}

void swap(int &x, int &y) 
{
    int temp = x;
        x = y;
        y = temp;
}

// quick sort
int getIndex (int low, int high) 
{
    int value = A[high];
    int i = low;
    for(int j=low; j<high;j++)
    {
        if(A[j] <= value) 
        {
            swap(A[i], A[j]);
            i++;
        }
    }
    
    swap(A[i], A[high]);
    return (i);
}

void quickSort(int low, int high) 
{
    if(low < high) 
    {
        int index = getIndex(low, high);
        quickSort(low, index - 1);
        quickSort(index + 1, high);
    }
}

// merge sort
void merge (int left, int mid, int right)
{
    int index = left;
    int k = mid - left + 1, m = right - mid, i,j;
    int tempLeft[k];
    int tempRight[m];
    for (i = 0; i < k; i++) 
    {
        tempLeft[i] = A[i + left];
    }
    
    for (j = 0; j < m; j++) 
    {
        tempRight[j] = A[j + mid + 1];
    }
    
    i = 0, j = 0;   
    while (i < k && j < m)
    {
        if(tempLeft[i] < tempRight[j])
        {
            A[index++] = tempLeft[i];
            i++;
        } 
        else
        {
            A[index++] = tempRight[j];
            j++;
        }
    }
    
    while (i < k)
    {
        A[index++] = tempLeft[i];
        i++;
    }
    
    while (j < m)
    {
        A[index++] = tempRight[j];
        j++;
    }
}

void mergeSort (int left, int right)
{
    if(left < right)
    {
        int mid = (right + left) / 2;
        mergeSort(left, mid);
        mergeSort(mid + 1, right);
        merge(left, mid, right);
    }
}

// insert sort
void insertSort() 
{
    for(int i = 0; i < N; i++)
    {
        int temp = A[i];
        int j = i;
        while (j > 0 && A[j] < A[j - 1] && j < N)
        {
            A[j] = A[j - 1];
            A[j - 1] = temp;
            j--;
        }
    }
}

void menu ()
{
    std::cout << "Enter choice: \n";
    std::cout << "1. Quick sort \n";
    std::cout << "2. Merge sort \n";
    std::cout << "3. Insert sort \n";
    std::cout << "0. Exit \n";
    int choice;
    std::cin >> choice;
    switch (choice)
        {
            case 1:
                quickSort(0, N-1);
                break;
            case 2:
                mergeSort(0, N-1);
                break;
            case 3:
                insertSort();
                break;
            case 0:
                break;
            default:
                break;
        }
}

int main()
{
    menu();
    return 0;
}

Show compiler warnings [ + ] Compiler args [ - ] Show input
Compilation time: 0.42 sec, absolute running time: 0.07 sec, cpu time: 0.02 sec, memory peak: 3 Mb, absolute service time: 0,5 sec