#include <chrono>
#include <iostream>
#include <vector>

using namespace std;

int partition(vector<int> &arr, int low, int high) {
  int pivot = arr[high];
  int i = low - 1;

  for (int j = low; j < high; ++j) {
    if (arr[j] <= pivot) {
      ++i;
      swap(arr[i], arr[j]);
    }
  }
  swap(arr[i + 1], arr[high]);
  return i + 1;
}

void quicksort(vector<int> &arr, int low, int high) {
  if (low < high) {
    int pi = partition(arr, low, high);
    quicksort(arr, low, pi - 1);
    quicksort(arr, pi + 1, high);
  }
}

int main() {
  vector<int> array = {10, 7, 8, 9, 1, 5};

  auto start = chrono::high_resolution_clock::now();
  quicksort(array, 0, array.size() - 1);
  auto end = chrono::high_resolution_clock::now();
  chrono::duration<double> elapsedTime = end - start;

  cout << "Sorted array: ";
  for (int num : array) {
    cout << num << " ";
  }
  cout << "\nTime taken: " << elapsedTime.count() << " seconds\n";

  return 0;
}