Show Navigation
Notices by tekk (tekk@social.tekk.in), page 30
-
@tekk related: it just clicked today why divide and conquer works. you're just minimizing extralinear growth as much as possible
-
Computer Science is the study of how to lose all your hair in such a way that your smart rock can be lazy
-
For an example of one of those not-easiest problems: create an array with "virtual initialization". That is, for an array of size n, accessing any uninitialized element e should return some default value v and set e to it in O(1) time. Make use of your free coefficients in your Big-O.
-
Maybe giving myself an hour to do like 10 worked physics problems was a bad idea.
-
I'll probabl ythrow out not-easiest problems just due to the fact that, you know, homeworks are only due every so often. I'll of course never ask a question I wasn't myself able to answer.
-
For some context here: these problems I give @lottievixen are the easiest problems off of homeworks for my uni's graduate level algorithm design & analysis course. Mostly I toss the easiest out because they get the point across and they're way easier to explain. The benefit is that, because of how CS works, I'm basically tossing out interview questions.
-
Since @jamey brought it up, here's the introductory amortization problem: You have a binary number implemented as an arbitrarily long array of booleans. 5, for example, is [true, false, true]. Prove that increment runs in O(1) amortized time.
-
@jamey I would like to be nice and post solutions but social doesn't have spoilers/CWs
-
@jamey constant worst case time works 100%, no amortization needed. "Find" is misleading, cheat 😉
-
@lizardsquid First person to solve it I think (did you get it before @lottievixen ?)
-
@lizardsquid you're overthinking. You want 2 stacks.
-
Oh yeah, and you're *implementing* the stack, so you can implement all of the methos and the actual storage however you want.
-
@lottievixen You did, but no worries. Here's the deal: Build me a stack which has the normal stack routines (push, pop) but it also has another one: find-min. Each of these 3 functions should run in constant (O(1)) time. You can use as much memory as you want, so yes @er1n you can have another stack, although saying it out loud spoils the solution a bit ;)
-
@zoowar it wasn't in Cockneys vs Zombies.
-
@lnxw48a1 It's not too surprising since every game which is written in java does that anyway these days. Easier to do that than to just pray everyone's jre is up to date. Minecraft was the first I know of to start it.
-
Oh shit on the #switch there's dragonball xenoverse 2 PLUS thimbleweed park (ron gilbert, the inventor of the point&click adventure's new point&click)
-
@thezacattacks This was me back in 2010 when my only computer was a dell latitude from 2001. Plug a usb hub in the back, one of the 2 ports for a usb wifi dongle, one of the 2 ports for a flash drive to run puppy linux on (the hdd was dead at the time) :)
-
@bob I can confirm that even minor clubs (like our linux user group) requires a treasurer and bookkeeping even when the money is literally only used to buy 1-3 pizzas once a week. Our only dues are "Hey, if you want us to feed you at the meeting this week give the treasurer like $1 when you see him"
-
@bthall Oh sorry, I hit favorite on your favoriting of me saying that we were required to take a class on #R
-
Seriously though. Me going into statistics: there must be some sort of rigor and reasonability to all this pattern finding to pull good results out of real world data, right? Me coming out of statistics with an A: Nah, it's pretty much as arbitrary as I thought coming in.
tekk
All Jonkman Microblog content and data are available under the