Unconventional Sorting Algorithms
codingkaiser.blog
Unconventional Sorting Algorithms
1–10 of 60 posts
Re: Unconventional Sorting Algorithms
#2NIH admits Fauci lied about funding Wuhan gain-of-function experiments
https://www.washingtonexaminer.com/opinion/nih-admits-fauci-...
Re: Unconventional Sorting Algorithms
#3NIH admits Fauci lied about funding Wuhan gain-of-function experiments https://www.washingtonexaminer.com/opinion/nih-admits-fauci-...
Not related to sorting algorithms.
Re: Unconventional Sorting Algorithms
#4Bogosort is always a fun one, because I think its one of the better introductions to NP-complete problems.
If you imagine that there's no "easy" algorithm to return a sorted list (but sorted lists do exist), then the only methodology possible is to try all combinations. And you do this either systematically, or randomly.
Random NP-complete algorithms, such as WalkSAT, are quite good in practice. Systematic NP-complete algorithms, such as DPLL-SAT, are more "obvious" in how they work, and are sufficient for smaller sizes.
Re: Unconventional Sorting Algorithms
#5NIH admits Fauci lied to congress and funded covid-19:
https://www.nationalreview.com/news/nih-admits-to-funding-ga...
Re: Unconventional Sorting Algorithms
#6Isn't 'sleep sort' linear with respect to array size?
O(n) sort achieved?
Re: Unconventional Sorting Algorithms
#7What about this one? This one was mentioned a couple of weeks back and is really funny.
Re: Unconventional Sorting Algorithms
#8My contribution: Power Sort.
Start with p=0 and add 2^n for each n. Then subtract the largest power of 2 successively to get your integers ordered.
Con: p will be very big.
Pro: you don't need ifs!
Re: Unconventional Sorting Algorithms
#9Isn't 'sleep sort' linear with respect to array size? O(n) sort achieved?
It is if you ignore how the underlying OS implements multitasking and sleep() in particular. And the kernel-side implementation usually involves some kind of priority queue of sleeping threads. So taken as a whole sleep-sort is just an convoluted implementation of heap-sort that outsources the actual sorting to OS.
Re: Unconventional Sorting Algorithms
#10I recently found a fun linear-time systolic sorting algorithm. I'd describe the serial implementation as unconventionally obvious. It's like insertion sort, without all the bother of swapping.
def index_sort(a):
n = len(a)
output = [None] * n
for i in range(n): #can run in parallel, damn the GIL
index = 0
for j in range(n):
if a[j]