From b81a457de5751ad09b0221b9c86c29fe618c772d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?kleines=20Filmr=C3=B6llchen?= Date: Thu, 10 Nov 2022 21:18:26 +0100 Subject: [PATCH] AK: Change quicksort comments to standard // style --- AK/QuickSort.h | 21 ++++++++++----------- 1 file changed, 10 insertions(+), 11 deletions(-) diff --git a/AK/QuickSort.h b/AK/QuickSort.h index 5824cd0d35..8d026a5933 100644 --- a/AK/QuickSort.h +++ b/AK/QuickSort.h @@ -12,17 +12,16 @@ namespace AK { -/* This is a dual pivot quick sort. It is quite a bit faster than the single - * pivot quick_sort below. The other quick_sort below should only be used when - * you are stuck with simple iterators to a container and you don't have access - * to the container itself. - * - * We use a cutoff to insertion sort for partitions of size 7 or smaller. - * The idea is to avoid recursion for small partitions. - * The value 7 here is a magic number. According to princeton's CS algorithm class - * a value between 5 and 15 should work well in most situations: - * https://algs4.cs.princeton.edu/23quicksort/ - */ +// This is a dual pivot quick sort. It is quite a bit faster than the single +// pivot quick_sort below. The other quick_sort below should only be used when +// you are stuck with simple iterators to a container and you don't have access +// to the container itself. +// +// We use a cutoff to insertion sort for partitions of size 7 or smaller. +// The idea is to avoid recursion for small partitions. +// The value 7 here is a magic number. According to princeton's CS algorithm class +// a value between 5 and 15 should work well in most situations: +// https://algs4.cs.princeton.edu/23quicksort/ static constexpr int INSERTION_SORT_CUTOFF = 7;