| 
|
QuoteRef: fenwP7_2001a
topics >
all references >
ThesaHelp:
references e-f
Topic:
execution profile
Topic:
search algorithms
Topic:
algorithmic complexity analysis
Topic:
efficiency
Topic:
handling complexity
Reference
Fenwick, P., "Some perils of performance prediction: a case study on pattern matching", Software--Practice and Experience, 31, 9, July 25, 2001, pp. 835-843. Google
837 ;;Quote: for search, speed and character comparisons may not be related; e.g., diagram search is 386x better by comparisons and 240x to 13x better by speed
843 ;;Quote: speed varies widely across test data, computers, compilers, and optimization level; simple measures such as comparisons may be ineffectual
843+;;Quote: simple algorithms often faster because easily optimized and good cache performance
ThesaHelp: references e-f (168 items)
Topic: execution profile (42 items)
Topic: search algorithms (40 items)
Topic: algorithmic complexity analysis (10 items)
Topic: efficiency (96 items)
Topic: handling complexity (59 items)