Pseudocode SolutionsPseudocode Solutions

🕵️

The Secret Order

Week 3, 2026

All Solutions

The Secret Order PSEUDCODE SOLUTION | MarsKing | Pseudocode Solutions

FUNCTION ISALPHATIBCAL(text:STRING) RETURNS BOOLEAN DECLARE charchters:ARRAY[1:LENGTH(text)] OF CHAR DECLARE sorted:BOOLEAN FOR Count ← 1 TO LENGTH(text) charchters[Count] ← MID(text,Count,1) NEXT Count sorted ← TRUE FOR Count ← 1 TO (LENGTH(text)-1) IF ASC(charchters[Count]) > ASC(charchters[Count+1]) THEN sorted ← FALSE ENDIF NEXT Count IF LENGTH(text)= 1 THEN sorted ← FALSE ENDIF RETURN sorted ENDFUNCTION DECLARE line:STRING OPENFILE "AllWords.txt" FOR READ WHILE NOT EOF("AllWords.txt") READFILE "AllWords.txt", line IF ISALPHATIBCAL(line) = TRUE THEN OUTPUT line ENDIF ENDWHILE CLOSEFILE "AllWords.txt"

Pseudocode | program52 | Pseudocode Solutions

CONSTANT DICTIONARY = "words.txt" DECLARE line : STRING OPENFILE DICTIONARY FOR READ WHILE NOT EOF(DICTIONARY) DO READFILE DICTIONARY, line IF isAlphabetical(line) THEN OUTPUT line ENDIF ENDWHILE CLOSEFILE DICTIONARY FUNCTION isAlphabetical(word : STRING) RETURNS BOOLEAN IF LENGTH(word) < 2 THEN RETURN FALSE ENDIF DECLARE index : INTEGER FOR index ← 1 TO LENGTH(word) - 1 IF MID(word, index, 1) > MID(word, index + 1, 1) THEN RETURN FALSE ENDIF NEXT index RETURN TRUE ENDFUNCTION