I am trying to make quick sort the problem is with that it starts taking input upto given n but then it stops working

#include<iostream>
using namespace::std;
void quicksort(int p,int q,int a[]);
int partition(int a[],int m,int p);
void interchange(int a[],int i,int j);
int main()
{
	int arr[10],n;
	cout<<"Enter the no of elements ";
	cin>>n;
	cout<<"Enter elements in array : ";
	for(int i=0;i<n;i++)>
	{
		cin>>arr[i];
	}
	quicksort(0,n-1,arr);
	for(int i=0;i<n;i++)>
	{
		cout<<arr[i];
	}
	return 0;

}
void quicksort(int p,int q,int a[])
{
	int j;
	if(p<q)>
	{
		j= partition(a,p,q+1);
		quicksort(p,j-1,a);
		quicksort(j+1,q,a);
	}
}
int partition(int a[],int m,int p)
{
	int V=a[m],i=m,j=p;
	while(i<j)>
	{
		while(a[i]<=V&&i<p)>
		{
			i=i+1;
		}
		while(a[i]>V)
		{
			j=j-1;
		}
		if(i<j)>
		{
			interchange(a,i,j);
		}
	}
	int temp=a[m];
	a[m]=a[j];
	a[j]=temp;
	return i;
}
void interchange(int a[],int i,int j)
{
	int temp;
	temp=a[i];
	a[i]=a[j];
	a[j]=temp;
}