|
Size: 31
Comment:
|
Size: 977
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| = Assignment 2 = | <<TableOfContents>> = Assignment 2: Ordered Word Ladders = An ''ordered word ladder'' ('owl') is an alphabetically-ordered sequence of words where each word in the sequence differs from its predecessor by one action: 1. changing one letter, e.g. ''barn→born'' 1. adding or removing one letter, e.g. ''band→brand'' and ''bran→ran'' The following are examples of word ladders of different length: * ''ban→bar→boar→boat→goat'', length 5 * ''an→can→cane→dane→date→mate→mite→site→size'', length 9 At the heart of the assignment is a function that compares 2 arbitrary null-terminated strings and returns ''true'' if the strings satisfy one of the 2 conditions above, and ''false'' otherwise. This function has signature: {{{#!cplusplus bool differByOne(char *, char *) }}} Write such a function and of course test it. Details of the assignment will follow shortly. |
Contents
Assignment 2: Ordered Word Ladders
An ordered word ladder ('owl') is an alphabetically-ordered sequence of words where each word in the sequence differs from its predecessor by one action:
changing one letter, e.g. barn→born
adding or removing one letter, e.g. band→brand and bran→ran
The following are examples of word ladders of different length:
ban→bar→boar→boat→goat, length 5
an→can→cane→dane→date→mate→mite→site→size, length 9
At the heart of the assignment is a function that compares 2 arbitrary null-terminated strings and returns true if the strings satisfy one of the 2 conditions above, and false otherwise. This function has signature:
1 bool differByOne(char *, char *)
Write such a function and of course test it.
Details of the assignment will follow shortly.