{

for (auto n : nums) {

std::cout << n << " ";

}

{

std::srand(std::time(nullptr));

std::vector<int> nums;

for (int i = 0; i < length; ++i) {

int x = min + (rand() % max - min + 1);

nums.push_back(x);

}

return nums;

{

int pivot = nums[high];

int index = low;

for (int i = low; i <= high; ++i) {

if (nums[i] < pivot) {

std::swap(nums[index++], nums[i]);

}

}

std::swap(nums[index], nums[high]);

return index;

{

if (low >= high) {

return;

}

int pivot = partition(nums, low, high);

quicksort(nums, low, pivot - 1);

quicksort(nums, pivot + 1, high);

{

std::cout << "Numbers before sorting: ";

print(nums);

quicksort(nums);

std::cout << "\nNumbers after sorting: ";

print(nums);

std::cout << "\nIs sorted: " << std::boolalpha << std::is_sorted(nums.begin(), nums.end());

std::cout << "\n";

{

std::vector<int> nums = generateRandomNumbers(20, -1000, 1000);

test(nums);

return 0;