Simple Quicksort Bilangan C++

#include <iostream>

using namespace std;

int Ar[100];

void quickSort(int arr[], int kiri, int kanan){
    int i = kiri, j = kanan;
    int simpan;
    int tengah = arr[(kiri + kanan) / 2];

    while(arr[i] < tengah){
        i++;
    };
    while(arr[j]>tengah){
        j--;
    };
    if(i <= j){
        simpan = arr[i];
        arr[i] = arr[j];
        arr[j] = simpan;
        i++;
        j--;

    };
    if(kiri<j){
        quickSort(arr, kiri, j);
    }
    if(i < kanan){
        quickSort(arr, i, kanan);
    }
}

int main()
{
    int bykData;

    cout<<"Masukan jumlah banyak data = ";cin>>bykData;
    Ar[bykData];
    for(int i = 0; i<bykData; i++){
        cout<<"\nMasukan Bilangan ke "<<i+1<<" = ";cin>>Ar[i];
    }
    quickSort(Ar, 0, bykData-1);
    cout<<"\nData yang sudah di urutkan ";
    for(int i = 0; i<bykData; i++){
        cout<<Ar[i]<<" ";
    }

    return 0;
}