BN Critters - June 6th, 2008

[diverg]

Thanks SP. I've enjoyed this weeks strips.

[SharkOnLand]

I love the smell of fresh Critters in the morning....

Great work again!

(Yes, I'm contributing to the "boobies" phenomenon)

[alphabits]

[alphabits]

[Tarheel Tail-Gator]

This explains the perma smile!

[alphabits]

Just trying to validate SP's "unscientific" research.

[Tarheel Tail-Gator]

Just trying to validate SP's "unscientific" research.

Some things are scientific and some things are just Facts of Like (uh, I mean Facts of Life)

[alphabits]

[Gulfbreeze]

Yes

[alphabits]

[alphabits]

[Gulfbreeze]

Slow day at work?

[alphabits]

Slow day at work?

Was it that obvious?

Circumstances beyond my control ..... plenty of stuff that needs to be done BUT I can't proceed until I get additional information. And the people that have that information are apparently in no big hurry to provide it. And so we get the continuing adventures of Noodleman!

[Gulfbreeze]

Slow day at work?

Was it that obvious?

Circumstances beyond my control ..... plenty of stuff that needs to be done BUT I can't proceed until I get additional information. And the people that have that information are apparently in no big hurry to provide it. And so we get the continuing adventures of Noodleman!

Here's what I heard they need:

void sort(int a[], int lo0, int hi0) throws Exception {
int lo = lo0;
int hi = hi0;
pause(lo, hi);
if (lo >= hi) {
return;
}
int mid = (lo + hi) / 2;

/*
* Partition the list into two lists and sort them recursively
*/
sort(a, lo, mid);
sort(a, mid + 1, hi);

/*
* Merge the two sorted lists
*/
int end_lo = mid;
int start_hi = mid + 1;
while ((lo <= end_lo) && (start_hi <= hi)) {
pause(lo);
if (stopRequested) {
return;
}
if (a[lo] < a[start_hi]) {
lo++;
} else {
/*
* a[lo] >= a[start_hi]
* The next element comes from the second list,
* move the a[start_hi] element into the next
* position and shuffle all the other elements up.
*/
int T = a[start_hi];
for (int k = start_hi - 1; k >= lo; k--) {
a[k+1] = a[k];
pause(lo);
}
a[lo] = T;
lo++;
end_lo++;
start_hi++;
}
}
}

void sort(int a[]) throws Exception {
sort(a, 0, a.length-1);
}
}


Now get busy...I'm going to have a beer.

[alphabits]

I don't think a Java sort algorithm is gonna help them revalue 10,000+ plus fixed assets in 15 countries ..... so ..... I'll just keep goofin' off and looking out the window wistfully at my bike.

[Gulfbreeze]

I don't think a Java sort algorithm is gonna help them revalue 10,000+ plus fixed assets in 15 countries ..... so ..... I'll just keep goofin' off and looking out the window wistfully at my bike.

Have 1 person from each country google "depreciation"

There, dishes are done...next project?

[alphabits]

I don't think a Java sort algorithm is gonna help them revalue 10,000+ plus fixed assets in 15 countries ..... so ..... I'll just keep goofin' off and looking out the window wistfully at my bike.

Have 1 person from each country google "depreciation"

There, dishes are done...next project?

Check.
OK, now I need a general ledger account to record the gain or loss on asset revaluation.

[alphabits]

Hey, wait a minute, when did we stop talking about boobies?

[Gulfbreeze]

Check.
OK, now I need a general ledger account to record the gain or loss on asset revaluation.

These corporate geeks are making this far to difficult



Next...

[alphabits]

Check.
OK, now I need a general ledger account to record the gain or loss on asset revaluation.

These corporate geeks are making this far to difficult



Next...

They're not all that bright ..... got anything that uses fingers and toes?