krgamestudios/Toy
1
0
Fork 0
mirror of https://github.com/krgamestudios/Toy.git synced 2026-04-15 23:04:08 +10:00
Code Issues Packages Projects Releases Wiki Activity

Made quicksort on mostly-sorted arrays more efficient

Browse Source
This commit is contained in:
Kayne Ruse
2023-06-13 07:17:20 +10:00
parent 50d03e28fc
commit 8a2cb61435
1 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
repl/lib_standard.c
View File

@@ -1471,8 +1471,13 @@ static void recursiveLiteralQuicksortUtil(Toy_Interpreter* interpreter, Toy_Lite
swapLiteralsUtil(&ptr[runner], &ptr[literalCount - 1]); swapLiteralsUtil(&ptr[runner], &ptr[literalCount - 1]);
//recurse on each end //recurse on each end
if (runner > 0) {
recursiveLiteralQuicksortUtil(interpreter, &ptr[0], runner, fnCompareLiteral); recursiveLiteralQuicksortUtil(interpreter, &ptr[0], runner, fnCompareLiteral);
}
if (runner < literalCount) {
recursiveLiteralQuicksortUtil(interpreter, &ptr[runner + 1], literalCount - runner - 1, fnCompareLiteral); recursiveLiteralQuicksortUtil(interpreter, &ptr[runner + 1], literalCount - runner - 1, fnCompareLiteral);
}
} }
static int nativeSort(Toy_Interpreter* interpreter, Toy_LiteralArray* arguments) { static int nativeSort(Toy_Interpreter* interpreter, Toy_LiteralArray* arguments) {