Re: OT - an announcement

On Thu, 03 Jan 2008 02:03:07 GMT, peachy ashie passion
<exquisitepeach@xxxxxxxxxxx> wrote:

Merrick Baldelli wrote:

On Sat, 29 Dec 2007 15:17:57 GMT, peachy ashie passion
<exquisitepeach@xxxxxxxxxxx> wrote:


Anim8rFSK wrote:


In article <gv4an3pj8dleom8fprefp4tjmrr2qdri1f@xxxxxxx>,
Merrick Baldelli <mbaldelli@xxxxxxxxx> wrote:



On Tue, 25 Dec 2007 20:37:01 GMT, peachy ashie passion
<exquisitepeach@xxxxxxxxxxx> wrote:



Merrick Baldelli wrote:



On Mon, 24 Dec 2007 18:20:58 GMT, peachy ashie passion
<exquisitepeach@xxxxxxxxxxx> wrote:




No. That explains why you didn't have a comment about your
resisting though. We were talking about you.

I've nearly given up on you and James.

Giving up on Ken is for another thread. Or another day.

Or maybe just another post.


And yet... Gone for as many months as I've been, you've never
given up on me *beams*... Pay attention kids, *I* rank!

No, no I haven't!


*gloats* keep paying attention boys, and try to take the piss
outta me, it's not going to work when the proof is in the pudding.



Well, of course, it's a little different. Because I'm giving up on
hitting on Anim, that is. And I don't hit on you.
I am free of those weird urges to convert people's sexuality to
something it isn't, even when I do not get it.

Well yeah... Thing is though these boys are much like the
kids at slashdot (http://slashdot.org) they all talk like they're
getting it, but just remember where they are when they're responding
to things. You have to approach them a little differently...

See, the thing is instead of waggling the vital bits at them,
which causes the lot of them to stand and drool like Gorillas in a
cage because they didn't have a chance at those bits during the
formative years, you need to bring them closer by dangling electronic
gadgetry in their direction.

Damn. Man has a point.

Serious? *sigh*

Okay, how would that actually work in practice?


You're asking who? Anim? Or me?

Anim doesn't sound like he's had all that much experience, all
things considered.

Me? Ha! How should I begin this? Some sort of thesis? Or
be some sort of Jeff Corwin of the Geek world?


How about starting with a top 10 list? That is always popular at
this time of year.

*chuckles* I don't do Top 10 lists.. They actually take more
work for me than you can imagine. I have a better chance
understanding some obscure sub-form for my 2007 Income Tax, than I
would trying to put it down as a Top 10 list...

--
-=-=-/ )=*=-='=-.-'-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
_( (_ , '_ * . Merrick Baldelli
(((\ \> /_1 `
(\\\\ \_/ /
-=-\ /-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
\ _/ Who are these folks and why have they
/ / stopped taking their medication?
- Captain Infinity
.

Relevant Pages

  • RE: Incident investigation methodologies
    ... However, what sort of reaction ... Speculation gets you nowhere. ... > malware we encounter. ... > of what makes public lists useful - you can get some ...
    (Incidents)
  • Re: Detailed explanation of how a QuickSort Works
    ... Firstly, if you consider the simple "Bubble Sort" algorithm, it works by running through the entire data set, one item at a time, comparing each item to the previous item and swapping them if they are not already in the correct order. ... by simply running through the entire list just once (and splitting it into two smaller lists) you have cut the sorting time in half. ...
    (microsoft.public.vb.general.discussion)
  • Re: Ordering Products
    ... algorithms. ... lists with constrained item transpositions. ... I think while the built in sort works as a convenience, ... Overall it's about 10 times slower than pythons built in sort for large ...
    (comp.lang.python)
  • Re: Ordering Products
    ... > Kay Schluehr wrote: ... >> It would be interesting to examine some sorting algorithms on factor ... >> lists with constrained item transpositions. ... > I think while the built in sort works as a convenience, ...
    (comp.lang.python)
  • Re: Educated guesses for efficiency?
    ... it is comparatively rare for a program to run too slowly because an algorithm with the wrong big-O analysis was chosen. ... of things tended to be stored in lists). ... built-in sort function. ... Programmers *will* use algorithms with high complexities. ...
    (comp.lang.c)