1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88
|
#include <iostream>
#include <string>
using namespace std;
void numbers();
void quickSort(int arr[], int left, int right);
int main()
{
string weather[] = {"Winter","Summer","Spring","Fall"};
for(int i = 0; i < 4; i++){
cout << "Weather types: " << weather[i] << endl;
}
cout << endl;
numbers();
return 0;
}
//FUNCTION FOR INT ARRAY
void numbers()
{
int nums[10] = {12,88,66,18,1,3,8,99,102,855};
//SORTING NUMBERS
quickSort(nums[],12,855); //ERROR HERE
//DISPLAY ARRAY
for(int i = 0; i < 10; i++){
cout << "List of numbers: " << nums[i] << endl;
}
}
void quickSort(int arr[], int left, int right)
{
int i = left, j = right;
int tmp;
int pivot = arr[(left + right) / 2];
/* partition */
while (i <= j) {
while (arr[i] < pivot)
i++;
while (arr[j] > pivot)
j--;
if (i <= j) {
tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
i++;
j--;
}
};
/* recursion */
if (left < j)
quickSort(arr, left, j);
if (i < right)
quickSort(arr, i, right);
}
|