// Text flavor: splitting a sentence into words by hand, since the notation has no SPLIT, then tallying. // EXPECT: {"a": 2, "is": 2, "rose": 3} // A HASHMAP prints its keys smallest first, whatever order they were added in. FUNCTION WORDS(S : STRING) RETURNS LIST OF STRING DECLARE Out : LIST OF STRING DECLARE W : STRING W <- "" FOR EACH C IN S IF C == ' ' THEN IF LENGTH(W) > 0 THEN APPEND(Out, W) ENDIF W <- "" ELSE W <- W & C ENDIF NEXT C IF LENGTH(W) > 0 THEN APPEND(Out, W) ENDIF RETURN Out ENDFUNCTION FUNCTION TALLY(Ws : LIST OF STRING) RETURNS HASHMAP OF STRING : INTEGER DECLARE T : HASHMAP OF STRING : INTEGER FOR EACH W IN Ws IF W IN T THEN T[W] <- T[W] + 1 ELSE T[W] <- 1 ENDIF NEXT W RETURN T ENDFUNCTION OUTPUT TALLY(WORDS("a rose is a rose is rose"))