Answer
procedure longestword (String sentence : a series of characters and words separated by blank spaces)
Split sentence into separate words: $w_1, w_2, w_3, .... w_n$
{Notice that this could be done by taking any set of characters between blank spaces as a word}
word largest $:= w_1$
for $i: = 1$ to $n$
$\space\space\space$if length$($largest$)
Work Step by Step
The algorithm attempts to find the largest word in an English sentence. It does this by first splitting the sentence in separate words (based on blank spaces) and then comparing the lengths of each. Notice how our implementation is sort of high-level. For example, we did not implementing the split or length procedures. This would be allowed in high-level description of algorithms since this is not for a computer to read.
