When you want to find the unique entries in (especially) a large collection of items, first you sort it, then you walk through the list to fetch the unique items. (Thanks to the sort, all duplicate items are adjacent.) You cannot, AFAIK, do this in just one step, unless the sort-utility or package that you are using provides that option.
TMTOWTDI, of course. Memory-based tricks such as hash-tables are certainly fine up to a point. The sort-then-uniq strategy will handle data of any quantity and will do so with linear performance.
Existing CPAN packages, as mentioned, are always to be looked-for first. (No matter what you’re doing, it has been done before.)
-
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.
|
