while True:
    while comp(a[left], pivot_vlaue):
        left += 1
    while left < right and not comp(a[right], pivot_value):
        right -= 1
    ....

while True:
    while comp(a[left], pivot_vlaue):
        left += 1
    while left < right and not comp(a[right], pivot_value):
        right -= 1
    ....

#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    std::vector<int> a(100, 1);
    std::sort(a.begin(), a.end(), [&](int x, int y){
        return x <= y;
    });
}
/*
[M] dan13 % g++ -std=c++20 test.cpp && ./a.out
zsh: segmentation fault  ./a.out
but when I do < it is fine.
*/

#include <algorithm>
#include <iostream>
#include <vector>

int main() {
    std::vector<int> a(100, 1);
    std::sort(a.begin(), a.end(), [&](int x, int y){
        return x <= y;
    });
}
/*
[M] dan13 % g++ -std=c++20 test.cpp && ./a.out
zsh: segmentation fault  ./a.out
but when I do < it is fine.
*/

 
var start = time.now()
sort(...)
var end = time.now()
print(end - start)

 
var start = time.now()
sort(...)
var end = time.now()
print(end - start)