## Invitation to Computer Science 8th Edition

$\bullet$ Get the elements of the list $N_{1}, N_{2}, \ldots N_{k}$ $\bullet$ Get the value of $S U M$ $\bullet$ Set the value of Found to $N O$ $\bullet$ Set the value of $i$ to 1 $\bullet$ While both $(i \leq k)$ and (Found $=N O )$ do $\bullet \quad$ Set the value of $j$ to $i+1$ $\bullet\quad$ While both $(j \leq k)$ and $(\text { Found }=N O)$ do $\bullet \quad\quad$ If $N_{i}+N_{j}=S U M$ then $\bullet \quad\quad\quad$Set value of Found to YES $\bullet \quad\quad\quad$ Set value of term $_{1}$ to $N_{i}$ and term_ to $N_{j}$ $\bullet\quad\quad$ Increment $j$ by 1 $\bullet\quad$ End of loop $\bullet \quad$ Increment $i$ by 1 $\bullet$ End of loop $\bullet$ If Found $=Y E S$ then $\bullet\quad$ Print the result $\left(\operatorname{term}_{1}, \text { term }_{2}\right)$ $\bullet$ Else $\bullet\quad$ Print "Sorry, there is no such pair"
$\bullet$ Get the elements of the list $N_{1}, N_{2}, \ldots N_{k}$ $\bullet$ Get the value of $S U M$ $\bullet$ Set the value of Found to $N O$ $\bullet$ Set the value of $i$ to 1 $\bullet$ While both $(i \leq k)$ and (Found $=N O )$ do $\bullet \quad$ Set the value of $j$ to $i+1$ $\bullet\quad$ While both $(j \leq k)$ and $(\text { Found }=N O)$ do $\bullet \quad\quad$ If $N_{i}+N_{j}=S U M$ then $\bullet \quad\quad\quad$Set value of Found to YES $\bullet \quad\quad\quad$ Set value of term $_{1}$ to $N_{i}$ and term_ to $N_{j}$ $\bullet\quad\quad$ Increment $j$ by 1 $\bullet\quad$ End of loop $\bullet \quad$ Increment $i$ by 1 $\bullet$ End of loop $\bullet$ If Found $=Y E S$ then $\bullet\quad$ Print the result $\left(\operatorname{term}_{1}, \text { term }_{2}\right)$ $\bullet$ Else $\bullet\quad$ Print "Sorry, there is no such pair"