5903 Intro Scientific Prog:
Coincidence Index: Specification
- The program should compute the coincidence index for various shifts in a file.
- This means you read in a file (potentially in bits or using
some other memeory conserving trick) and count the number of times
character[i] = character[i+shift].
- The output should be a list of the shifts and the
coincidence index for those shifts. The format should be a completed
tab/newline seperated table of the form.
shift |
count |
0 |
|
1 |
|
2 |
|
3 |
|
4 |
|
5 |
|
6 |
|
7 |
|
8 |
|
9 |
|
10 |
|
nb. For simplicity simply drop the overlaps at start and stop.
- I would like a timing on how long it takes to do "A Tale of two Citis" by Charles Dickens in the ReadMe.
- There needs to be a clean command in the makefile.