quick sort merge sort practice

#include <iostream>
#include <vector>
using namespace std;

void quick_sort(vector<int> &nums,int l,int r);
void merge_sort(vector<int> &nums,int l,int r,vector<int> &temp);

int main()
{
    vector<int> vec(10,0),temp(10,0);
    int i = 0;
    while(i < 10)cin >> vec[i++];
    //quick_sort(vec,0,9);
    merge_sort(vec,0,9,temp);
    while(i > 0)cout << vec[--i] << " ";
    return 0;
}
void quick_sort(vector<int> &nums,int l,int r)
{
    if(l >= r)return;
    int first = l,last = r,key = nums[first];
    while(first < last)
    {
        while(first < last && nums[last] >= key)last--;
        nums[first] = nums[last];
        while(first < last && nums[first] <= key)first++;
        nums[last] = nums[first];
    }
    nums[first] = key;
    quick_sort(nums,l,first);
    quick_sort(nums,first + 1,r);
}
void merge_sort(vector<int> &nums,int l,int r,vector<int> &temp)
{
    if(l >= r)return;
    int m = l + (r - l + 1)/2;
    merge_sort(nums,l,m - 1,temp);
    merge_sort(nums,m,r,temp);

    int p = l,q = m,i = l;
    while(p <= m - 1 || q <= r)
          {
              if(q > r || (p <= m - 1 && nums[p] <= nums[q]))temp[i++] = nums[p++];
              else temp[i++] = nums[q++];
          }
    for(i = l;i <= r;++i)nums[i] = temp[i];
}