Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Re: Re: Re: sort with fewest moves

by theorbtwo (Prior)
on Feb 11, 2002 at 01:16 UTC ( #144548=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Re: sort with fewest moves
in thread sort with fewest moves

I think it's the first one. Performance isn't exactly "inconsequential", but it doesn't have to be purticularly good. In O(n) terms, it doesn't much matter because n is small(ish). It's more of a question of what the coefecient is.

(Which is one reason I think that O(n) is overused, but that's a question for another node.)

TACCTGTTTGAGTGTAACAATCATTCGCTCGGTGTATCCATCTTTG ACACAATGAATCTTTGACTCGAACAATCGTTCGGTCGCTCCGACGC

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://144548]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (2)
As of 2022-01-23 13:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (63 votes). Check out past polls.

    Notices?