Goddamn it human resource machine you can't fail me for not programming for variables you didn't tell me about

@Scruffo why

@plaguedaemonart Which level are you at?

@Scruffo I tried to do the alphabetize one and my algorithm didn't check for short words and identical words

@plaguedaemonart Oh... alphabetizer? I never beat that one.

@Scruffo I got a working algorithm for different words, now when I go back i have to tell it to check for the end of a string or something

I'm not sure how much I'm gonna need to change

@plaguedaemonart From what I understand of the five seconds I've looked at it, I do not have a solution.

All I can guess is that I probably want to have numerical values associated with the two words and check them against each other.

I am literally too stupid to come up with a better solution.

@Scruffo You gotta subtract the letters from each other until it gets to a letter with an unequal value. Then if they're the same or if one of words ends early, the loop ends and that word goes in the outbox

programming's wacky and also this is wackier because C++ knew multiplication

@plaguedaemonart Would you subtract them on a letter by letter basis or get the full numerical string before finding the real word?

@plaguedaemonart And do you subtract the letter with another letter or the letter from a null point you copy from the provided zero?

@plaguedaemonart Definitely need a jump if zero in there.

@Scruffo You start with a 0 and a 10, so I told it to put one string starting at [0] and one at [10] using bump+ and ending the loop when it gets to 0 (you wanna put the 0 down with the string so it can be read later), then I reset the values to 0 and 10 and had another loop that subtracted [0] from [10] and vice versa, and when it reached a negative value that would mean it found the word that came first and would jump to a third loop that would place the word in the outbox

@Scruffo sorry if I wrote that confusing it's kind of a lot

@plaguedaemonart I mean you can copy/paste the values onto text, for example this is a quick thing I made a few seconds ago
-- HUMAN RESOURCE MACHINE PROGRAM --

COPYFROM 23
COPYTO 22
a:
INBOX
JUMPZ b
COPYTO [23]
BUMPUP 23
JUMP a
b:
c:
INBOX
COPYTO [24]
BUMPUP 24
JUMPZ d
JUMP c
d:

@Scruffo -- HUMAN RESOURCE MACHINE PROGRAM --

a:
b:
COPYFROM 24
COPYTO 21
COPYFROM 23
COPYTO 22
c:
INBOX
COPYTO [22]
JUMPZ d
BUMPUP 22
JUMP c
d:
e:
INBOX
COPYTO [21]
JUMPZ f
BUMPUP 21
JUMP e
f:
COPYFROM 24
COPYTO 21
COPYFROM 23
COPYTO 22

@Scruffo g:
COPYFROM [22]
JUMPZ i
SUB [21]
JUMPN h
COPYFROM [21]
SUB [22]
JUMPN k
BUMPUP 22
BUMPUP 21
JUMP g
h:
i:
COPYFROM 23
COPYTO 22
j:
COPYFROM [22]
JUMPZ b
OUTBOX
BUMPUP 22
JUMP j
k:
COPYFROM 24
COPYTO 21
l:
COPYFROM [21]
OUTBOX
JUMPZ a
BUMPUP 21
JUMP l

@Scruffo it's a lot haha

@Scruffo oh neat i beat three sort even though i didn't check for negatives

how dare you judge me, human resource machine

@plaguedaemonart I guess does your solution deal with if the words are different lengths?

@Scruffo nope, that's what i'm fixing right now

@Scruffo Ok now it does

just barely not optimized :/

@Scruffo Now I'm trying three sort again, which I had a similar problem with because I didn't check for negatives

@plaguedaemonart @Scruffo Why not? It happens everyday at my job?

@DemmyB @Scruffo because it makes me sad :(

@plaguedaemonart @Scruffo It makes me sad in real life too :'>

@DemmyB @Scruffo This is why I quit programming

Programming for all inputs is hard

Server run by the main developers of the project It is not focused on any particular niche interest - everyone is welcome as long as you follow our code of conduct!