mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-25 00:50:22 +00:00
0dc9af5f7e
Also run it across the whole tree to get everything using the One True Style. We don't yet run this in an automated fashion as it's a little slow, but there is a snippet to do so in makeall.sh.
39 lines
786 B
C++
39 lines
786 B
C++
#pragma once
|
|
|
|
namespace AK {
|
|
|
|
template<typename T>
|
|
bool is_less_than(const T& a, const T& b)
|
|
{
|
|
return a < b;
|
|
}
|
|
|
|
template<typename Iterator, typename LessThan>
|
|
void quick_sort(Iterator start, Iterator end, LessThan less_than = is_less_than)
|
|
{
|
|
int size = end - start;
|
|
if (size <= 1)
|
|
return;
|
|
|
|
int pivot_point = size / 2;
|
|
auto pivot = *(start + pivot_point);
|
|
|
|
if (pivot_point)
|
|
swap(*(start + pivot_point), *start);
|
|
|
|
int i = 1;
|
|
for (int j = 1; j < size; ++j) {
|
|
if (less_than(*(start + j), pivot)) {
|
|
swap(*(start + j), *(start + i));
|
|
++i;
|
|
}
|
|
}
|
|
|
|
swap(*start, *(start + i - 1));
|
|
quick_sort(start, start + i - 1, less_than);
|
|
quick_sort(start + i, end, less_than);
|
|
}
|
|
|
|
}
|
|
|
|
using AK::quick_sort;
|