The Powder Toy

Sorting algorithms by LBPHacker

LBPHacker
LBPHacker
224 / 8
27th Dec 2018
3rd Aug 2021
This is a sorting algorithm demonstration tool. I made this because I wanted to end the year with a fun save. Don't give me that look, yes, I find this incredibly fun! :P My absolute favourite is Heapsort, despite the fact that it's not a stable sort.
computer subframe sorting algorithm r216k2a z2tags z1more z0no z4everyone z3thanks

Comments

  • LBPHacker
    LBPHacker     3rd Jan 2019
    It is definitely possible, I brought it up because 12Me21 did just that once while attempting to increase text throughput.
  • Timothysparrow
    Timothysparrow     3rd Jan 2019
    to encode instructions
  • Timothysparrow
    Timothysparrow     3rd Jan 2019
    It isn't possible to make machines to do that LBP? I wouldn't know, I don't do good with electronics in TPT.
  • LBPHacker
    LBPHacker     3rd Jan 2019
    @12Me21: I've kinda given up on speeding up anything on the R2 :P Even though encoding the text as instructions is both more space-efficient and time-efficient than what I do now, reminds me of my failure to come up with something better.
  • funky3000
    funky3000     3rd Jan 2019
    Ahh I see. Tho by most efficient I was more meaning the fastest. According to jacob's tests with the same data set, other sorts are faster. I mostly mean a smart sort would calculate the next non-cheat move that would be fastest. But yeah, I understand about not adding much more. I completely expect that something like what I imagine would require a separate save. Like I said, mostly inspiration. If you're ever feeling bored lol
  • jacob1
    jacob1     3rd Jan 2019
    Yeah back when I was briefly working on a text game before deciding it didn't have enough RAM, I had faster text displaying code. I think I was writing the asm to send each character to the display, instead of storing and loading a text string to be sent to the display (slow)
  • 12Me21
    12Me21     3rd Jan 2019
    You need to speed up your text displaying code lol
  • LBPHacker
    LBPHacker     2nd Jan 2019
    Well, like I implied, I'm not planning on adding reverse sorts, mostly because they do increase complexity (have any of you seen the code? it's madness!) and at this speed and dataset size they'd probably affect performance negatively. And anyway, Heapsort is mathematically perfect! :P
  • funky3000
    funky3000     2nd Jan 2019
    Like, if a bubble sort would be more efficient for a certain step, or if an insertion sort would be better. Perhaps this would be a lot more complicated, maybe even requiring its own save, and would perhaps be on par with an AI. I personally know nothing about making computers myself, but I'm more than happy to provide inspiration!~ <3
  • funky3000
    funky3000     2nd Jan 2019
    Here's a cool thing you could try if you add reverse sorts: A "smart sort" that determines whether it could be easier or harder to sort in reverse or forwards, and maybe choose the most efficient sort moveset for a particular step. I get the feeling that, by having a program choose what the smartest move would be besides ugly hacks, that it could be the second fastest below ugly hacks by using the easiest sort pattern and making the best moves for a particular sort.