AK: Make quick_sort() a little more ergonomic

Now it actually defaults to "a < b" comparison, instead of forcing you
to provide a trivial less-than comparator. Also you can pass in any
collection type that has .begin() and .end() and we'll sort it for you.

1 files changed, 1 insertions, 1 deletions

diff --git a/Userland/sort.cpp b/Userland/sort.cpp
index 1521344830..009069dca5 100644
--- a/Userland/sort.cpp
+++ b/Userland/sort.cpp
@@ -50,7 +50,7 @@ int main(int argc, char** argv)
         lines.append(buffer);
     }
 
-    quick_sort(lines.begin(), lines.end(), [](auto& a, auto& b) {
+    quick_sort(lines, [](auto& a, auto& b) {
         return strcmp(a.characters(), b.characters()) < 0;
     });