15,796,299 members
See more:
Hi,

In the experiments we used a PC with Intel Pentium® 4 2.4 GHz processor, with L1 cache of 8KB and L2 cache of 512KB, and 512MB of RAM. The host operating system is Windows® XP professional. The compiler used is Microsoft® Visual C++ 6.0.

HOW TO GET THE PERFORMANCE RESULTS IN TERMS OF GRAPH?

1. SPECIFIC INPUT
2. RANDOM INPUT.

WHATS THE PROCEDURE?
Posted

## Solution 2

In general, to study the performance of an algorithm you should fist implement the algorithm and than implement a function that

- queries a timer
- call the algorithm giving it the required testing data
- queries the timer (again)

The difference between the values of the two queries is the elapsed.
About timers, you can fund some useful articles here
http://www.codeproject.com/info/search.aspx?artkw=high+resolution+timer[^]
or by google "windows high resolution timer".

To come to a graph, you have to repeat that process a number of times, passing different type of data (or calling different algotithm implementations) to came to a "series of numbers".
This can be done:
- manually, calling the testing program many times after changing the data, then pasting the number into a spreadsheet (like excel) and produce a graph,
- semiautomatically by making the testing program able to do the repeated calls and save the results in a text file (that you will later import into a spreadsheet)
- Automatically by writing a testing program that also displays the data in the form of a graph (more complex, if you are unaware of how graphics work on windows, and in general not suitable as a "portable test", but certainly more "scenographic")

## Solution 1

Which performances ? With what are you stuck exactly ? Could you refine a bit your question so that it is not that generic ?

## Solution 3

string text:aaaa...a
pattern:aaaa...a

??????????????