|
Luigi Thirty posted:dick presence usually is unfortunately dick presence sounds like a bloodborne secret boss
|
#
?
Dec 5, 2016 06:53
|
|
|
|
| # ? May 26, 2024 06:31 |
|
|
LeftistMuslimObama posted:dick presence sounds like a bloodborne secret boss Either that or a really weird christmas Chalks fucked around with this message at 07:59 on Dec 5, 2016 |
|
#
?
Dec 5, 2016 07:56
|
|
|
LeftistMuslimObama posted:neat. and all the sorting algos get mixed up in my head because sorting is trivial in my lang, so i just remember that they're mostly "break array in half, do thing". sorting is trivial in every lang, in the sense that every standard library can sort. nobody manually implements sorting.
|
|
#
?
Dec 5, 2016 07:57
|
|
|
Sapozhnik posted:(heap sort is the best general purpose sort though, for the record) I have implemented couple of sorts actually, but usually only special ones (toposort, cycle sort etc) And maaaybe I was testing different quicksort variants for fun once?  Also, both heapsort and in-place merge sort are poo poo. (The fotmer because its awfully slow for n log n algorithm, the latter because its not n log n) Adaptative quicj/merge sort or dual pivot quicksort is where its at.
|
|
#
?
Dec 5, 2016 08:02
|
|
|
dual pivot quicksort is supposed to have quadratic cases too, and in this case it has been established that the advocate of that is a person who farts rudely while speaking.
|
|
#
?
Dec 5, 2016 08:04
|
|
|
uncurable mlady posted:is programming games at all interesting from a hobby project perspective some android games got me a job, so yes. they were fun to make and play which was really good on the "keeping me motivated" front
|
|
#
?
Dec 5, 2016 08:06
|
|
|
Asymmetrikon posted:same, but only through hofs like fold and never explicitly (or as little explicitly as possible)
|
|
#
?
Dec 5, 2016 08:18
|
|
|
In-place mergesort is totally n log n, in-place merging evenly-sized lists is linear in the number of elements and each element is merged log(n) times. (It's slow because o(n) in-place merging has some pretty big overheads. To the point where a slower-than-o(n) yet simpler merge would still come out ahead on any realistic data set.)
|
|
#
?
Dec 5, 2016 08:49
|
|
|
i implemented sleepsort once
|
|
#
?
Dec 5, 2016 09:12
|
|
|
Sapozhnik posted:dropwizard is poo poo, it is aimed at the sort of people who would be happier writing python which part That is, what makes something "like python", what does dropwizard do that is "like python", and what benefits does your server/framework have over Dropwizard or its subcomponents because it's not/less "like python"? FamDav fucked around with this message at 09:40 on Dec 5, 2016 |
|
#
?
Dec 5, 2016 09:37
|
|
|
Fergus Mac Roich posted:dual pivot quicksort is supposed to have quadratic cases too, and in this case it has been established that the advocate of that is a person who farts rudely while speaking. It probably does, its not about defense against quadratic case as much as about trading (waaay) more swaps for (couple) less comparisons and coming out ahead in comparison to traditional quicksort, because swapping small elements is cheap, branching isn't. Jabor posted:In-place mergesort is totally n log n, in-place merging evenly-sized lists is linear in the number of elements and each element is merged log(n) times. AFAIK its overhead are so big its pointless to use rather than the algorithmically slower variant. (Which might be what you are saying in the parentheses)
|
|
#
?
Dec 5, 2016 09:41
|
|
|
fart simpson posted:i implemented sleepsort once Is this where you can't figure out a problem so give up in frustration, and then the next day you realise that it's not actually a problem?
|
|
#
?
Dec 5, 2016 09:49
|
|
|
The hardest problem of computer science: naming things. What should I call the general interface for any source of input events in my game input system? Like it can be a keyboard key, a mouse button, a joystick/gamepad button/axis, etc. Right now I call it InputSource which isn't very descriptive.
|
|
#
?
Dec 5, 2016 09:53
|
|
|
welp, just ICEd MSVC in file with 30 lines of simple templates (that are probably wrong, but still)
|
|
#
?
Dec 5, 2016 10:44
|
|
|
raminasi posted:sorting is trivial in every lang, in the sense that every standard library can sort. nobody manually implements sorting. I have implemented a manual bubble sort in cases where it is actually efficient, like just with 3 or 4 items, just for fun. I am sure it annoyed someone but I don't really care.
|
|
#
?
Dec 5, 2016 10:45
|
|
|
gonadic io posted:Is this where you can't figure out a problem so give up in frustration, and then the next day you realise that it's not actually a problem? no its the one where you sort a list of numbers by spawning a new thread for each one that sleeps for x duration where x is the number you're sorting.
|
|
#
?
Dec 5, 2016 10:50
|
|
|
raminasi posted:sorting is trivial in every lang, in the sense that every standard library can sort. nobody manually implements sorting. actually in embedded basically 90% of what we do is reimplement basic library features over and over
|
|
#
?
Dec 5, 2016 14:02
|
|
|
redleader posted:i used recursion once, to merge two xml documents. the code was, needless to say, very bad. took me a while to get it right too
|
|
#
?
Dec 5, 2016 14:17
|
|
|
Fergus Mac Roich posted:point taken about the ease of implementation. i was considering that perhaps stability might be a more common requirement than no extra space, but if we're already in an environment where some kind of Arrays.Sort() method isn't available, maybe memory is that big of an issue. quote:This code is litteraly copied from the C++ stl library and translated in Java. shaggar homepage found.
|
|
#
?
Dec 5, 2016 14:45
|
|
|
Sapozhnik posted:ehh you probably want a stable sort, like mergesort, and uh, an adaptive one means it goes O(n) on sorted data, it's neat
|
|
#
?
Dec 5, 2016 15:00
|
|
|
Blinkz0rz posted:cases in which you need recursion: recursion or tail recursion? because tail recursion is basically just a loop that looks pretty. assuming a compiler/interpreter with TCO.
|
|
#
?
Dec 5, 2016 15:26
|
|
|
uncurable mlady posted:is programming games at all interesting from a hobby project perspective if the game involves some aspect that's interesting on the programming side, yes if it's something where all the interesting bits are handled for you by the engine, not really
|
|
#
?
Dec 5, 2016 15:34
|
|
|
c tp s ruminating over interfaces, wondering just how stupid consumers are
|
|
#
?
Dec 5, 2016 15:57
|
|
|
HAHA jesus christ i just looked at our main competitor's product and their interface is literally: foo('commandName', [varargs]) their entire API consists of more than a dozen 'functions' called as strings
|
|
#
?
Dec 5, 2016 16:00
|
|
|
c teaching s: Students of our new program (? no idea what these are properly called in english) wrote letter to people who oversee it, that they are overtaxed and my course is the main culprit. I spent the last 20 minutes doing stats on their (self reported) times needed per homework, and after clearing out really bad data (no, you did not work 4891620 hours on a homework, especially not in a week) they are more or less on course to hit expected time requirements per course credit. Welcome to university bitches. 
|
|
#
?
Dec 5, 2016 17:28
|
|
|
they are in for a huge shock when they get their first programming job
|
|
#
?
Dec 5, 2016 17:49
|
|
|
Xarn posted:c teaching s: Students of our new program (? no idea what these are properly called in english) wrote letter to people who oversee it, that they are overtaxed and my course is the main culprit. bone app the teeth posted:they are in for a huge shock when they get their first programming job
|
|
#
?
Dec 5, 2016 18:06
|
|
|
catching kernel signals everyday!
|
|
#
?
Dec 5, 2016 18:20
|
|
|
my artisinal solution to control flow
|
|
#
?
Dec 5, 2016 18:26
|
|
|
In reality, we will ease up a bit, because while the average student should fit into the time limit, below average won't and we shouldn't make it impossible for them to pass as well. The sad thing about this is that many academics agree with the above... because universities here are financed according to number of enrolled students.
|
|
#
?
Dec 5, 2016 18:27
|
|
|
oh no blimp issue posted:caching kernel signals everyday!
|
|
#
?
Dec 5, 2016 19:06
|
|
|
ctps: currently being driven nuts by cache invalidation. loving microservices means to find out what forms a user has filled in takes like 6 (internal) http calls. The caches were fine for a while, but now we're resetting forms and it is loving everything up. Either we get rid of the caches or every reset call needs to be duplicated to reset the cache too, making the microservices entirely pointless Xarn posted:In reality, we will ease up a bit, because while the average student should fit into the time limit, below average won't and we shouldn't make it impossible for them to pass as well. Ask me about unethical marking practices in courseworks!!
|
|
#
?
Dec 5, 2016 19:13
|
|
|
ctps: sitting down @ the standup
|
|
#
?
Dec 5, 2016 19:26
|
|
|
VOTE YES ON 69 posted:ctps: sitting down @ the standup gently caress the police
|
|
#
?
Dec 5, 2016 19:27
|
|
|
VOTE YES ON 69 posted:ctps: sitting down @ the standup I just stand them up
|
|
#
?
Dec 5, 2016 19:36
|
|
|
Soricidus posted:I just stand them up 
|
|
#
?
Dec 5, 2016 20:01
|
|
|
VOTE YES ON 69 posted:ctps: sitting down @ the standup There's another way??
|
|
#
?
Dec 5, 2016 20:32
|
|
|
guess who's got two thumbs and found out that there's an entire class of stored procedures in prod using SELECT *? but it's ok guys they properly prefixed it at least so it's really SELECT <tableName>.*
|
|
#
?
Dec 5, 2016 20:53
|
|
|
"<package> can't be updated since node.js after version 0.10 cannot run on this router because v8 dropped support for processors without a fpu in version 3.18" i found it: the worst sentence
|
|
#
?
Dec 5, 2016 21:00
|
|
|
|
| # ? May 26, 2024 06:31 |
|
|
i always sit for stand up b/c it takes place 4 feet behind my desk so I just spin around
|
|
#
?
Dec 5, 2016 21:19
|
|