If the algorithm is exactly duplicated between Perl and Java, yes, Java is likely to win but C would beat them both. BUT the whole point of Perl is that it lends itself to creating more efficient algorithms easily and so much so that when approached properly, even C is likely to lose unless the C program is massive enough in its complexity to duplicate the terser optimal Perl algorithm. In this case, you are effectively processing all permutations instead of using any kind of sorting efficiency. Try to think of a way to represent the data so that as many losing iterations as possible simply aren't processed by an improved algorithm.
-
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.
|