I feel the use of Hash might not be required for your task. You have recordID which can act as an index to an array so why put them in a hash and mess up the order? You get linear access in array using index anyways an no overhead of the hash-table
That said, i would do a Matrix(nxn) (square not a requirement, dimensions might change based on num of records of course) to keep track of scores. Consider the following table
File1rec/File2rec | 1 | 2 | 3 | 4 | 5 | 6 |
1 | 3 | 7 | 8 | 9 | 9 | 10 |
2 | 4 | 8 | 3 | 1 | 1 | 6 |
3 | 1 | 4 | 9 | 4 | 9 | 7 |
4 | 4 | 3 | 10 | 7 | 2 | 3 |
5 | 4 | 2 | 5 | 9 | 9 | 5 |
6 | 5 | 6 | 2 | 5 | 6 | 9 |
The values inside the cell are the scores. Now if you want the best matching score (max value) then a O(n) max will provide you the answer for your records and you have to do that n-times for each record in your first file.
Sorting to finx max/min is an overkill. I might be missing your porblem so please correct me if i am wrong.
cheers
SK
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|