quick sort in c 2b 2b

1#include <bits/stdc++.h> 
2using namespace std;  
3  
4 
5void swap(int* a, int* b)  
6{  
7    int t = *a;  
8    *a = *b;  
9    *b = t;  
10}  
11  
12
13int partition (int arr[], int low, int high)  
14{  
15    int pivot = arr[high];  
16    int i = (low - 1);  
17  
18    for (int j = low; j <= high - 1; j++)  
19    {  
20     
21        if (arr[j] < pivot)  
22        {  
23            i++;  
24            swap(&arr[i], &arr[j]);  
25        }  
26    }  
27    swap(&arr[i + 1], &arr[high]);  
28    return (i + 1);  
29}  
30  
31
32void quickSort(int arr[], int low, int high)  
33{  
34    if (low < high)  
35    {  
36        
37        int pi = partition(arr, low, high);  
38   
39        quickSort(arr, low, pi - 1);  
40        quickSort(arr, pi + 1, high);  
41    }  
42}  
43  
44
45void printArray(int arr[], int size)  
46{  
47    int i;  
48    for (i = 0; i < size; i++)  
49        cout << arr[i] << " ";  
50    cout << endl;  
51}  
52  
53
54int main()  
55{  
56    int arr[] = {10, 7, 8, 9, 1, 5};  
57    int n = sizeof(arr) / sizeof(arr[0]);  
58    quickSort(arr, 0, n - 1);  
59    cout << "Sorted array: \n";  
60    printArray(arr, n);  
61    return 0;  
62}