The Nineteenth Byte

« first day (1402 days earlier) ← previous day next day → last day (3738 days later) »

Timtech

23:03

Ook! 4810 bytes Coming soon to a chicken near you Ook. Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook! Ook? Ook? Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. Ook. ...

tee hee hee

ugh i forgot arbitrary number of ints.

.............

Martin Büttner

is it just a binary version?

Timtech

im a chicken

fixed code asap

added link to interpreter+updated code for arbitrary ints..

Martin Büttner

@Timtech o.O

Timtech

dipley nuggets

Martin Büttner

I don't even understand the joke

Timtech

23:11

i forgot the input validation

joke?? ;p

Martin Büttner

I'm pretty sure that input "2 3" is "an arbitrary number of parameters"

Timtech

Martin Büttner

as is "2"

Timtech

wow

the rest of the code wont fit

:<<<<

Martin Büttner

Peter Taylor

23:14

@MartinBüttner, I don't suppose you'd consider relaxing "you must not use any built-in sorting functions" to permit the use of built-in sorting functions for a fixed small number of items? E.g. never sorting more than two items.

Martin Büttner

@PeterTaylor I suppose you want to find the median of 3 elements? ;)

Timtech

Wait is median a sorting function or waat

Peter Taylor

No, I was actually thinking of sorting two items and then using the sign of one of them to pick the appropriate end of the array.

Martin Büttner

oh okay

hmmm

Peter Taylor

It may or may not be the shortest way of doing it - I haven't worked through the alternatives yet - but it's certainly amusing.

Timtech

23:16

if (i[0]>i[1]) i={i[1],i[0]}

Peter Taylor

You're right, though, median of three is a better approach

Martin Büttner

"In addition, you must not use any built-in sorting functions, except to sort a fixed small number of items (less than 5)."

how does that sound?

Peter Taylor

Suits me. And fits the original intention of linear time.

Martin Büttner

someone want to help me undelete Ilmari's answer then? codegolf.stackexchange.com/a/42088/8478

Peter Taylor

He's sorting the entire input

~]$

Martin Büttner

23:23

I overlooked that

Timtech

oops

already voted

Martin Büttner

I only saw the $ at the end to get the median of 3

Timtech

dude xnor is smart

im going to use his method ^_^

Peter Taylor

Does the stack snippet really rely on every post starting with an h1?

Or can I use an h2 as I normally do?

Martin Büttner

you can use h2

Timtech

23:27

12 bytes.

im out

Martin Büttner

it just checks that there is at least one # in the first line, or a - or = in the second line

Timtech

im eating bbl my answer is legit btw ;)

Anyway gtg

Martin Büttner

@Timtech I'd say, if you wanna claim 12 bytes, you should provide a hex dump of the tokenised code

Timtech

I really have to eat tho

I'll do it tomorrow

Martin Büttner

@PeterTaylor oh, that's clever!

Peter Taylor

23:29

Gotta love fold

Martin Büttner

btw, I wouldn't mind if you expected the input to already be an array

CJam assumes that too, and I've allowed both variadic functions and functions taking an array, so I'd be lenient with STDIN as well

Peter Taylor

Ok, thanks

Martin Büttner

@Optimizer @FryAmTheEggman you might want to know that you can now sort arrays of fixed (small) size for the minmod challenge.

@overactor in Marbelous... how do you break a loop remotely? o.O

the best thing I can think of is something like writing a 2-input board, the outputs the first input left or right depending on the second input, and usually feed it with a 0, but remotely drop a 1 into it to break the loop.

also, I'd love to have |\ and /| cloners

« first day (1402 days earlier) ← previous day next day → last day (3738 days later) »

all rooms

Transcript for

Nov30

Dec '141

Dec2

The Nineteenth Byte: General discussion for codegolf.stackexc...

join this room
about this room

00:00

06:00

12:00

18:00

all times are UTC