|
Size: 950
Comment:
|
Size: 951
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 9: | Line 9: |
| 1. adding or removing one letter, e.g. ''heart→hear'', and ''band→brand'' | 1. adding or removing one letter, e.g. ''band→brand'' and ''bran→ran'' |
| Line 15: | Line 15: |
| At the heart of the assignment is a function that compares 2 strings and returns ''true'' if the strings satisfy one of the 2 conditions above, and ''false'' otherwise. This function could have the signature: |
At the heart of the assignment is a function that compares 2 arbitrary strings and returns ''true'' if the strings satisfy one of the 2 conditions above, and ''false'' otherwise. This function has signature: |
| Line 18: | Line 18: |
| bool areOwl(char *, char *) | bool differByOne(char *, char *) |
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:
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
cab→can→cane→dane→date→mate→mite→site→size, length 9
At the heart of the assignment is a function that compares 2 arbitrary 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.