Cambridge international AS and A level Computer Science 11.02 Expressing algorithms 1 mpuler scentis.sareinterested i finding yood Solutions & good solution gives the correct results takes up as litle computer memory as possible ac executes as fast as passible. The solution should be concise, elegant ane easy to understand, Incomoute’ seianca, se lgorith} using secvercas of steps writzen in structured Englich or pseudocode, Structured Fal isz subsocot the Engl’sh language ard consists of ecmmantl alaamney Psoidet 5 2 3rogramming langusze w thoutfollowrg the syntax ck particular aregramming arquage a flowchart is a alle native method o' rearesenc'g 2° alyor thm. & llexuchart consists 0° spec'fic sh2 285, linked -ogather Analgerithm consists of a sequence of steps, Lider condi-ionswe mey wishna. 0 7 ‘Structured Engliske 2 austen she riglat anginye hot consists of command statements sec te ei slgoitn Preudocade: : «330 using eynords andicert® -gyrtevofa pariesla-omegieres og lara Flouchert: together ior owe design salut sa kstibrat lie pv etioo loa he viasteacofon sgcrtm a number of steps. tn commuter sc ence, wetien ct perform some ster Ne may wishto re ‘iti galgorithms, we use ‘our basic ypes ef corsir » Assignment: ayeliels ghen anare (ideation or the value as: cocked with gh comged. quence of formec a number o times. This 5 ais «nownes ‘teretion O° loging, putorovolve data, [he colution invowes routing and Sulpuiling resulls fas shown in Figure 11.02 Many problems we ty te solve data che comauter, processing the ds Figure 11.02 Inout-process-cutput Input therefore nts ‘o need inpstend outout st ed to know lie constructs stowe arrow now detailed curd he raree nosat ign has to be. asshoun In Tabo Ls, ine sare “epresentadin each These constru: