Age | Commit message (Collapse) | Author |
|
Signed-off-by: Aaron Ball <nullspoon@oper.io>
|
|
Was miscalculating nanosecond duration. This fixes that.
|
|
Signed-off-by: Aaron Ball <nullspoon@oper.io>
|
|
|
|
Signed-off-by: Aaron Ball <nullspoon@iohq.net>
|
|
Was storing file in the stack, which was causing segfaults on data sets
larger than 8 MB. Converted to use heap for file storage to expand
support for larger files.
|
|
Was only working with odds, since they have one letter at their center.
This change allows for a palindrome to have two letters at its center
(even numbered).
|
|
New algorithm is much more efficient. Compares small to large, rather
than large to small.
|
|
|
|
This script will generate random data to be used for testing the
palindrome finder program.
|
|
Unsigned are faster and since we never go negative (most of the time),
this isn't a problem and it provides support for much larger files.
|
|
Don't want to optimize ourselves out of obvlion. Going from optimize
level 3 to 2, since performance decrease is negligable.
|
|
|