« first day (1879 days earlier)      last day (3261 days later) » 

19:00
@Mego ಠ_ಠ
which increases popularity and keeps things in business
@Lembik yes.
has much golf power
Anonymous
@EasterlyIrk Sweatshops and abusive management are a GREAT example
plus the continuum was a very good direction , along with universal apps starting from 8.1
Going to answer a question.
Goodbye.
19:01
Going to optimize an answer.
Goodbye.
Oh wow, Rust tops the list of most loved languages. @Doorknob
Oh my gosh, WordPress is second on the list of most dreaded "languages".
rust has a lot of potential
@El'endiaStarman I saw :P
specially when servo is right up the corner
19:03
what languages don't natively support integers up to 2^31 ?
Anonymous
@El'endiaStarman VB is top, yay
@NathanMerrill Brainfuck
Anonymous
@NathanMerrill brainfuck, boolfuck, *fuck
> *fuck
@Doorknob Still haven't gotten to that point in the transcript. :P
19:03
it only supports a bit right?
Anonymous
@Dennis *fuck meaning insert BF derivative here
Anybody have problems with lichess sending account verification emails?
@Mego ZX Spectrum BASIC :)
Anonymous
brainfuck only supports bytes
I'm also happy that Python made the top 10 of most loved languages.
19:04
@NathanMerrill BBC Basic
I could go on.. :)
Oooh, and it's #4 on most wanted.
8086 assembly :)
Anonymous
C/C++ may or may not natively support 32-bit ints, depending on your hardware
@NathanMerrill Brainfuck supports bytes (most implementations do anyway). There are more than a few assemblies that only operate on 8 or 16-bit integers as well.
@Lembik oooh, what does BBC basic support?
19:05
@Mego does C99 not allow you to specify uint32 ?
@NathanMerrill I assume 8 bit ints
Anonymous
@Lembik I wouldn't consider that natively supporting on an 8-bit platform
well, I was thinking about answering this question:
5
Q: Integer range defaults for challenges

MegoWhen writing challenges involving integer I/O, I always find myself having to type the same thing: You may assume that the input and output will not exceed the maximum representable range in your language. I think it would be useful if we had a default for integer ranges in challenges, to avoid n...

Anonymous
C/C++ natively uses the word size of the hardware platform
and I was wondering if simply having a fixed number would be a good idea
Anonymous
Which, for most modern computers, is either 32 or 64 bits
19:06
@Doorknob Lichess have failed me.
@Mego pubs.opengroup.org/onlinepubs/9699919799/basedefs/stdint.h.html I am sure you are right.. C is very weird if you stick to the specs :)
Anonymous
But there are still platforms with smaller sizes
Why can people stand it?
its less ambiguous, and most languages can deal with it
Anonymous
@NathanMerrill If you were going with a fixed number, I'd say 8-bit integers, signed or unsigned (depending on the challenge).
19:07
@Mego oh actually.. C99 does not allow implementations without an integer type of at least 64 bits, since long long is required to be at least that large.
Anonymous
@Lembik C does not require any specific bit width for data types, only that they are at least as wide as the next-smallest type. Except for long long, which C99 requires to be at least 64 bits, apparently. Weird.
@Mego most challenges have numbers bigger than 255 XP
Anonymous
@NathanMerrill Then the challenge authors can always override the defaults
Anonymous
I'm still in favor of "the native range of your language or 32 bits, whichever is smaller"
@EasterlyIrk what
19:10
although seriously: what kind of computers (Even ancient ones) only used numbers up to 255
Anonymous
There's not a whole lot of circumstances I can think of where that policy would cause issues
Anonymous
@NathanMerrill NES
27 hours and 34 minutes before they sent an email confirming my account.
"Sorry sir, your paycheck is only $255 this month, as we can't represent a larger number"
>.<
@NathanMerrill Glad it isn't a overflow, getting -256 would suck.
19:11
@EasterlyIrk what...?
@Doorknob yep
I have no idea what you're saying
Anonymous
@EasterlyIrk It wouldn't overflow like that. It'd either be [0, 255] or [-128, 127] (unsigned or signed)
Anonymous
Unless you had a 9-bit platform, but then I'd have more questions
19:13
@Mego remember the glory days of "trinary is the next best thing"
Anonymous
@NathanMerrill ternary
A 9-trit platform would make more sense.
ah, I knew it was wrong
I won't ping you again
Anonymous
Ternary would be really cool except that it doesn't make any sense for electronics
19:14
I'd be all for base 12 computer
and a base 12 world
but those NAND gates would be horrid to write
Anonymous
Base 16 yo
@Mego You can make it make sense...it'd just be significantly harder.
Base 10 is the best base :P
@Mego definitely weird :)
19:16
@NathanMerrill What is 6? I don't have 6. I use base 10.
Is "Base 12" base twelve, or base five in ternary? That poll is so confusing.
Anonymous
@El'endiaStarman Rather than 0/5V, you'd need 0/5/10V, which means more power used and therefore more heat, making computers less efficient energy-wise
Everybody uses base 10.
1 min ago, by Geobits
Base 10 is the best base :P
Anonymous
19:17
Base 10 is your base's base regardless of what your base is
No, not with base 1
unless its base 0
@Mego You could probably use something like -5/0/5, but it would still be needlessly complicated.
@Mego Or maybe 0/2.5/5V. In any case, your objection wasn't "it doesn't make sense". :P
the problem with base 0 is that you can't even name your base
Anonymous
19:18
@Doorknob If you define a unary number's value as "the number of 1 digits in this number", it works
Anonymous
@Geobits -5/0/5 == 0/5/10
hmm.. how do I insert a picture?
Anonymous
@El'endiaStarman 2.5 V isn't enough of a difference for it to be reliable
@Mego I remember a teacher/professor who would write the names of bases. As in, 1001101_two or 256_ten.
@Mego -ish
Anonymous
19:19
@El'endiaStarman That's a little weird. I've seen 1001101_2 and 256_10, but not written-out English words
@Doorknob Bijective bases are weird.
@Mego Well, his reasoning was that you don't know what base 10 is in...
Anonymous
@Geobits Since voltages are just differences, they're the same. It's just a matter of choosing a different value to call "0".
my hilarious tern joke hasn't done so well :)
Anonymous
@El'endiaStarman The accepted norm is that you use decimal for base notations. Your professor was being overly pedantic.
19:22
@Mego That's one way of looking at it. My years of electronics experience rebel at the thought, though. 0V is "no difference".
If decimal is the accepted convention, 256_10 is just silly.
Eh, I wouldn't say he was being pedantic. I remember it being more in the sense of "you're making an assumption".
I wonder if anyone will submit a non-mergesort answer... maybe I should have thought of a way of encouraging that
Anonymous
@Geobits That's still a correct interpretation. 0V is "no difference from the ground/reference potential", to be exact. By changing your reference potential, you change the voltage values.
@Lembik I think you're leaning a little too far towards making challenge answerers do what you want.
19:25
Sure, but using non-ground reference makes my brain tingle.
Anonymous
@El'endiaStarman That's exactly what pedantry is - not being willing to make assumptions
Anonymous
@Geobits Just choose a different ground :)
@Mego I said nothing about willingness or the lack thereof.
@Mego D:
Anonymous
@El'endiaStarman I shouldn't make an assumption -> I am unwilling to make assumptions -> I have to be precise -> I am being pedantic
19:27
Writing out base names, while usually unnecessary, is completely unambiguous.
@Mego I didn't say anything about "should" or "shouldn't" either.
@El'endiaStarman right... lucky I didn't do it :)
Anonymous
@Geobits Even the actual ground isn't a constant potential
@El'endiaStarman although really what I want is many varied answers :)
Anonymous
There might be a potential difference of ~2V between the dirt where you are and the dirt where I am
I know, but it's close enough for most purposes.
And (relatively) constant over time in a given area.
19:29
@Lembik You kinda did away with that when you restricted the complexity to O(n log n)...
Anonymous
And there's no need to even use a metal rod sticking out of the dirt in most cases - as long as you have a constant reference, you're fine
@Dennis Including this guy:
Oh hello @CᴏɴᴏʀO'Bʀɪᴇɴ, normal conversation in here at present. :P
@Mego And your equipment is isolated from things that do rely on a metal rod, that is ;)
19:30
(ΦωΦ)
Nails in your eyes doesn't seem normal though.
I hate the new SE mobile chat BTW
As opposed to the old, non barely-functioning one? o_O
19:31
I had to click reply in order to get this dialogue open
Anonymous
@Geobits In the context of computers, which is what this discussion was about originally, your reference is the neutral wire in your power supply, which can be literally anything compared to true ground.
256_
ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}}}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}},{ø,{ø},{ø,{ø}},{ø,{ø},{ø,{ø}}}},{ø,{ø},{ø,{ø}},{ø,{
Anonymous
@Dennis This looks like Perl
2
And all I've heard from you Riker is "^" >_>
ohai
not anymore
19:32
\(-_______-;)/
I HAVE BIG VOCABULARY
big
@CᴏɴᴏʀO'Bʀɪᴇɴ Then disable it.
@El'endiaStarman nooooo... :) there are a lot of O(n log n) time sorting algorithms out there
15 words and digits
19:33
@Mego no it doesn't
@CᴏɴᴏʀO'Bʀɪᴇɴ Go to chat.stackexchange.com/users/129255/c-ob?tab=prefs, uncheck box.
@Mego Sure. I've also worked on avionics computers, which vary wildly from "ground" once in the air. That doesn't keep my brain from making up its own mind about this.
@Mego it can't be perl - the characters don't overlap
Anonymous
@orlp It's exactly as unreadable as Perl is (to me)
19:35
^
@Lembik Aaand since your question is , I highly doubt that most of those O(n log n) sorting algorithms (11 out of 25) will be any shorter than merge sort.
@El'endiaStarman maybe not shorter.. but maybe just fun :)
Anonymous
@Geobits Well tell your brain to stop being silly :P
@El'endiaStarman which is after all why we are all here!
@Lembik and here comes the infamous "must be competitive" restriction
19:36
@Lembik In whatever language you're using, you're supposed to pick the shortest implementation (that you can think of).
@Mego Tell your engineers to stop renaming things with 100+ years of legacy :P
@NathanMerrill What is that?
And, honestly, who knows how to implement Timsort, or Cubesort, or binary tree sort, or...?
I thought you could do what you like and see where the votes fall
@El'endiaStarman err.... some people :)
Anonymous
@NathanMerrill As I stated in my answer to the relevant meta post, I don't think there's an issue with using a suboptimal algorithm/approach, so long as that algorithm/approached is actually golfed
19:37
Some people...who would also know how to do merge sort.
@El'endiaStarman yes yes.. I understand that the easiest route is to do merge sort :)
@Mego which is closer to what I think the requirement should be "Shows effort"
but not everyone chooses the easiest route.. surely!
@Lembik Probably also the shortest.
I am a fan of the tri-fold platypus convergence sort
19:38
@Dennis btw lembik's sorting golf never states anything about counting sorts
@Cyoce good algorithm!
Anonymous
@NathanMerrill That's essentially what I tried to boil my meta answer down to, but being more specific so that it's less subjective
and you can do better than O(n log n) even on unbounded integers
@orlp well yes.. but not much :)
and no one has ever implemented those methods
8
Q: Is integer sorting possible in O(n) in the transdichotomous model?

orlpTo my knowledge there doesn't exist a $O(n)$ worst-case algorithm that solves the following problem: Given a sequence of length $n$ consisting of finite integers, find the permutation where every element is less than or equal to its successor. But is there a proof that it doesn't exist, in ...

sadly the answers to that question are beyond useless
as they don't even read the question
Anonymous
19:40
Code Jam registration is open!
@orlp true
@orlp I dare you to implement that :)
why do we require serious contenders?
I mean, people here are competitive
@Mego YUSS
Anonymous
19:43
@NathanMerrill Because ungolfed submissions in code golf are far too commonly posted and have no place in code golf challenges
@Mego Are you participating?
Anonymous
@ZachGates No, I'm just excited about it for no reason :P
@Mego so, we are trying to filter out "newbie" submissions?
@Mego Oh :P It's a lot of fun
there's a better solution for that: comment and downvote
Anonymous
19:44
@NathanMerrill No, we're trying to filter out zero-effort submissions
Anonymous
@ZachGates So is sarcasm, or so I've heard :P
ಠ_ಠ
commenting and downvoting still works for zero-effort submissions
@NathanMerrill There's a difference between badly golfed and not golfed at all. Newcomers are entitled to post badly golfed answers (everybody has to start somewhere), but they have to try at least.
Anonymous
Submissions that make no effort to achieve a good score according to the primary winning criterion are not allowed on this site
19:45
@Dennis I was referring to people that posted and didn't understand that it was even a competition at all
Anonymous
@NathanMerrill Flag, comment, delete
@Lembik still have to finish this some day drive.google.com/file/d/0B1-vl-dPgKm_T0Fxeno1a0lGT0E/view
@NathanMerrill Exactly. That is just as wrong as posting a golfed answer on SO, and it will have the same effect.
@orlp looks fun!
@Dennis but a golfed answer on SO isn't offtopic. It's simply a terrible answer
19:47
^
Very low quality is still a reason for deletion.
rather than trying to judge "how golfed is our minimum", we can simply vote based on how well the user is golfing
It'd still pass these criterion: meta.stackexchange.com/a/122447/234313
Anonymous
@NathanMerrill That is for VLQ flags. Trusted users can vote to delete any answer with a negative score that they deem unfit for the site.
I'm pretty sure that trusted users are deleting based on the same criterion (in most cases)
Anonymous
19:51
Also VLQ flags and delete votes can only happen on answers with a negative score. It's not implausible for a submission that is not a serious contender to have a positive score
anyways, we aren't a Q&A site, so its really not the argument to make
@Mego Why do you consider that answer not a serious contender?
@NathanMerrill As a trusted user on SU, I have voted to delete many wrong answers that I couldn't have flagged for moderator attention.
Anonymous
@ZachGates As I outlined in my meta answer, the only chance it had at winning is if no other submissions were posted.
the distinction though, is between "bad" and "wrong". I imagine the questions you deleted simply didn't work (or made the problem worse)
19:54
@Mego Do we just ban all java Code Golf answers then?
Anonymous
@KevinW. Please read my answer more thoroughly; I specifically made a concession for per-language subcompetitions in code golf, and per-algorithm/approach subcompetitions.
for example,
18
A: Java: Sort an array

isahIt may help you understand loops by implementing yourself. See Bubble sort is easy to understand: public void bubbleSort(int[] array) { boolean swapped = true; int j = 0; int tmp; while (swapped) { swapped = false; j++; for (int i = 0; i < array.length - j...

Bubble sort is inefficient and slow
nobody should be writing their own sorting code
TIL about Stooge sort.
Stooge sort is a recursive sorting algorithm with a time complexity of O(nlog 3 / log 1.5 ) = O(n2.7095...). The running time of the algorithm is thus slower compared to efficient sorting algorithms, such as Merge sort, and is even slower than Bubble sort, a canonical example of a fairly inefficient and simple sort. The algorithm is defined as follows: If the value at the end is smaller than the value at the start, swap them. If there are 3 or more elements in the list, then: Stooge sort the initial 2/3 of the list Stooge sort the final 2/3 of the list Stooge sort the initial 2/3 of the list again...
@ZachGates My main problem with that answer is that is uses 55 if the allowed 1024 bytes. There is so much room for improvement, but the poster doesn't want to.
but its still a valid answer
Anonymous
19:56
@El'endiaStarman Wow the oneboxed image is animated :o
WAIT WHAT THE WIKIPEDIA ONEBOX HAS THE GIF
Anonymous
@El'endiaStarman ninjo'd
I was halfway through typing when I saw your message. Finished anyway. :P
@NathanMerrill That's for sorting an array of size 10. Bubble sort is perfectly well suited for this task. Anyway, this doesn't matter, since SO doesn't hold programming competitions.
right, I agree, we are different
19:58
@NathanMerrill Is that a continuation of your thoughts on the SO answer or a response to my response to Zach?
@Dennis bubblesort is pretty much always worse than insertion sort
response to "Anyway, this doesn't matter, since SO doesn't hold programming competitions."
@Mego I think it was a clever answer. No, it isn't a winning answer, but it was clever and at least some effort was put in. What makes that answer any different from the ones that simply blur the image, or answers that drew several rectangles of various colors?
@Dennis ^
@NathanMerrill I meant but its still a valid answer.
@orlp For 10 integers, does it really matter?
oh it was a continuous of my thoughts
I should have hovered over the arrow
19:59
@Dennis I found a bug in http://smbf.tryitonline.net
This code is an infinite loop with empty input, but shouldn't be: ,[]
@Dennis yes
Anonymous
@ZachGates Drawing a single rectangle of a constant color is about as low-effort as you can get. The only way it could be lower-effort is if the default color was used.
in some cases, it can be super easy to detect whether an attempt was made (no whitespace was removed)
Anonymous
It's not clever at all, and there is absolutely no way that submission could win if there were other, serious-contender submissions posted
@NathanMerrill so we're disallowing whitespace now?
seems like a fine language to me
20:01
but for languages where whitespace matters (or isn't usually included anyways), it becomes tough
organizing bookmarks. I could do this all day.
IMO noncompetitive answers are fine
if you don't like their golfing, downvote
@Mego I believe answers like this are the "non-serious contenders".
let's not make arbitrary rules about what counts as trying or not
@mbomb007 I don't remember, but I think I never got to replacing the other interpreter with yours. I should do that.
20:02
@orlp I agree, but that's not the current state of the site
@orlp Completely agree
@mbomb007 I keep reading "SMBF" as "Super Mario BF". >_<
@El'endiaStarman lol
The existence of MarioLANG as a BF-like language doesn't help. :P
@orlp The answers I comment on or delete for not being competitive usually have a couple of upvotes already. Downvoting answers works in theory. In practice, the number of people who blindly upvote seems higher than the number of people who a willing to sacrifice part of their rep for some quality control.
20:05
^ That's what kinda makes me mad about that (almost-) no-effort answer.
+120/-19
It's literally the worst answer!
Second worst, after a blank image.
*worst (posted)
Well, there are even worse ones, but they'd require more effort.
@El'endiaStarman Oh, nevermind.
@El'endiaStarman which
And yes, a great answer score for something like this is a big slap in the face for those who spent hours if not days to write a good answer. Cheek trumps effort 9 times out of 10.
3
This is also why I consider popularity contests a bad idea. If this had been a pop con (like the OP originally planned), that answer would have won.
6
hmmm...I think I understand where we differ @Dennis I prefer the theoretical, unambigous rule, where you prefer the rules that actually work
Yeah that answer annoyed me a lot. I think this is the main reason that PeterTaylor complains about Hot Questions appearing in the se network feeds
well not the answer itself, just the amount of upvotes it got
lol
reddit's strategy against brown bears:
Brown bears are smart. If you play dead, they'll swipe at your genitals (and probably rip them off) to see if you're really dead. This is when you use the bear spray. Apply it directly to your own eyeballs to distract you from the pain of having your genitals ripped off.
@NathanMerrill And I agree that the current rule is ambiguous. If it weren't, that solid image answer would already have been deleted.
(Or at least not cause that much controversy.)
20:23
yeah
@El'endiaStarman lol :D
@Dennis Yeah. I'm not sure if this bug is related or not. Possibly. I don't remember how the Perl interpreter handles empty input...
Badly, it seems.
20:37
It seems to handle it normally.
@quartata doing things badly is normal for Perl
I mean it seems to just put an empty string in $_.
I don't see how that's a bad thing....
If you're talking about implicit ways of input, the program won't run at all for empty input.
What program?
Every time I see someone's answer in Jelly, I imagine they must be thinking, "My code is sooo short. You jelly? ^_^"
20:42
@Dennis Ooh, thanks for reminding me. I was going to add a question about pop cons to the Q&A
@quartata I read that as "pop cans" lol. +5¢
3 hours ago, by El'endia Starman
That 3-byte Jelly solution hurts.
And now that it's 2 bytes, combine with ಠ_ಠ.
@Doorknob I'm not in that league. :P
ven
ven
^
@mbomb007 I participated last year, failed miserably, and still had fun :P
@FryAmTheEggman At least Doorknob linked to it.
That's like saying, hey, the world Chess tourney is happening soon, wanna face Magnus Carlsen?
Hey, even if you only get past the qualification round it's still fun :P
@El'endiaStarman If you need a link to something hosted by Google you have a problem :P
20:47
I'd be too busy being tired to program at those times :(
@Doorknob uDebug alliws to calculate accepted output from a given input.
Yes, it includes Code Jam. :-)
@FryAmTheEggman Welllll.....laziness is a thing, y'know...
@FryAmTheEggman Here's a cool link: google.com
2
@Doorknob I'd rather try Ludum Dare
@mbomb007 ....I was expecting the target to be something else...
@El'endiaStarman :D
Wish I'd thought of that...
20:50
LMGTFY or whatever? :P
Ludum Dare and Code Jam are totally different
@NathanMerrill Yeah... so?
@FryAmTheEggman No, something that's often sneakily inserted into an innocent-seeming link.
@NathanMerrill You have a chance to win at one, and not the other.
ven
ven
20:51
I'm allowed to post multiple answers (different lang) to the same question, right?
In my case, probably neither.
If any of you remember me talking about Google foobar, I did get contacted by a google recruiter because of it
@ven YES! As many as u want.
but yeah, you're right, winning at code jam is pretty impossible
20:52
Not just a little impossible. Pretty impossible.
I have problems with data structures, and algorithms.
No way would I win at a world competition.
@El'endiaStarman no making fun of me :P
I wasn't making fun of you.
I never even won regionals in the ACM International Collegiate Programming Contest.
I know, it was a jest :P
@orlp Instead, lets vote on what counts as trying or not.
@MartinBüttner Some of the new Retina features sound confusing. It'd be helpful to have some examples using limits and nested loops.
ven
ven
How do I strike text?
Anonymous
3 dashes
Anonymous
---strikethrough---
20:57
<s>text</s> in main/meta site posts.
ven
ven
okay, thanks :)
@quartata What question?
Isn't <s> being deprecated eventually? I thought we were supposed to switch to <del>?
@Dennis What their thoughts on pop cons are.
20:58
@FryAmTheEggman Technically neither should be used; CSS should be used instead.
@FryAmTheEggman I haven't even heard of <del>. o.O
@quartata That's unrelated to moderation IMHO.
@Mego Ah, good point.
@quartata You still need some sort of marker to know what to apply the strikethrough to.
@El'endiaStarman Right, I'm just saying.
20:59
I'll bet <del> is the marker in this case.

« first day (1879 days earlier)      last day (3261 days later) »