Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

comment on

( [id://3333] : superdoc . print w/replies, xml ) Need Help??
So basically you want a pointer to a function.

I'm not too sure how to do that..I know that you
can create/use pointers within perl, but I haven't
dug through my tchrist notes in too long to even
have a clue of remembering how.

As far as making pointers to functions...couldn't
you just make a simple if/else or case based on the
designation variable to avoid the whole headache?
TIMTOWTDI, and all that, I guess.

What algorithm are you looking to use for your
array sort? The first glance made it look like a
bubble sort, which is fine if you aren't trying for
high performance. Otherwise, _Algorithms and Data
Structures_ by Corman-- aka the white cookbook, is
a good place to get a lot of non-language specific
psuedocode for just about every basic sorting option.

good luck, -B.

In reply to RE: Dynamic sort algorithm selection by brick
in thread Dynamic sort algorithm selection by Sentinel

Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":

  • 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.