aboutsummaryrefslogtreecommitdiff
path: root/src/sort.h
diff options
context:
space:
mode:
authorame <[email protected]>2026-05-27 06:00:43 -0500
committerame <[email protected]>2026-05-27 06:00:43 -0500
commit6f176096b8f3a2088c01d67a36e4b67750ec179e (patch)
tree78a195e1b743f56380e164177c5b1393126ed7d7 /src/sort.h
parent0addb6ba5b45168b7abe2ff0db6ddcfff20d1865 (diff)
.table updates, .dup & .equal
Diffstat (limited to 'src/sort.h')
-rw-r--r--src/sort.h10
1 files changed, 0 insertions, 10 deletions
diff --git a/src/sort.h b/src/sort.h
index e59cd4e..2b2efee 100644
--- a/src/sort.h
+++ b/src/sort.h
@@ -7,13 +7,3 @@ int l_mergesort(lua_State*); //[double+int] -> arr[N] (greatest -> least)
int l_shellsort(lua_State*); //[double+int] -> arr[N] (greatest -> least)
int l_bubblesort(lua_State*); //[double+int] -> arr[N] (greatest -> least)
int l_heapsort(lua_State*); //[double+int] -> arr[N] (greatest -> least)
-
-//non-comparison sorts
-//good for large arrays filled with small values
-int l_countingsort(lua_State*); //[int] (arr[N] >= 0) -> arr[N] (least -> greatest)
-
-//esoteric sorts
-int l_miraclesort(lua_State*); //[double+int] -> arr[-∞<=N<=∞] (greatest -> least)
-int l_stalinsort(lua_State*); //[double+int] -> arr[?<=N] (greatest -> least)
-int l_slowsort(lua_State*); //[double+int] -> arr[N] (greatest -> least)
-int l_bogosort(lua_State*); //[double+int] -> arr[N] (greatest -> least)