can you actually shut the fuck up right now. women and minorities have there lives on the line and all y’all can talk about is this. if kamala wins we can protest her stance. if trump wins and we protest his stance he’s already said he’ll deploy the national guard. y’all are so smug about ruining your chances of helping these people
interesting. I actually haven’t had any throughput issues yet but if I do I will definitely keep that in mind
I run jellyfin on bare metal because it makes it easier to debug imo, but I do use docker for caddy and some other little applications (like a tomcat instance for example)
my servers run alpine! it’s incredibly stable even for hobbiest use
camel for java. flat for c
username checks out
real actually. definitely one of the most memorable progress bars. well, that and the bios update progress bar
such a great show. thats one of the few shows set on an alien planet that truly feels unnervingly alien
“fix for real this time”
I just like filling up hard drives and sitting on top of them like a dragon hoarding ones and zeros
battery replacements usually run around 60-90 at my shop depending on the device, if I ever walked in to a shop and heard 200$ I’d walk tf out that’s insane pricing.
you can absolutely do it yourself. be prepared and get the right tools, look up many many guides and videos before you start, but I honestly think it’s doable for someone whose never opened a phone. those batteries are an absolute pain in the ass to remove, but as long as it’s discharged below 20% you really don’t have to worry about it it catching fire or anything catastrophic like you’re lead to believe (just be careful ofc and wear PPE)
programming! I had heard that programming is better on Linux so I gave it a go and quickly realized it was better for everything else as well
that does sound super nice. I’ll prob give it a go sometime soon, thanks!
is it still worth getting into? it seems like something I’d like but I’ve never played it before and don’t have crazy amounts of time like I used to. should I still give it a go?
my choice would prob be a 15k. at that point I’ll just do a half marathon, thanks.
yeah it sucks. here's a decent little writeup on it https://www.refinery29.com/en-us/2017/11/180698/jesse-lacey-brand-new-sexual-misconduct
great album, wish the lead singer wasn't a predator so I could listen to it shame free
don’t get discouraged. sorting algorithms occur frequently in interviews, and yes you use them a decent amount (especially in languages without built in sorts like c) but they are one of the harder things to visualize in terms of how they work. I’d say avoid anything recursive for now until you can get selection and insertion down pat. check out geeksforgeeks articles on them, but also don’t be afraid to Google willy nilly, you’ll find the resource that makes it click eventually.
in terms of efficiency, it does become a little more difficult to grasp without some math background. big o is known as asymptomatic notation, and describes how a function grows. for example, if you graph f1(x)=15log(x) and f2(x)=x, you’ll notice that if x is bigger than 19, then f2(x) always has a higher output value than f1(x). in computer science terms, we’d say f1 is O(log(n)), meaning it has logarithmic growth, and f2 is O(n), or linear growth. the formal definition of big o is that f(x) is O(g(x)), if and only if (sometimes abbreviated as iff) there exists constants N and C such that |f(x)| <= C|g(x)| for all x>N. in our example, we can say that C = 1, and N>19, so that fulfills definition as |15log(x)| <= 1|x| whenever x>19. therefore, f1(x) is O(f2(x)). apologies for just throwing numbers at you, (or if you’ve heard all this before) but having even just the most basic grasp of the math is gonna help a lot. again, in terms of best resources, geeksforgeeks is always great and googling can help you find thousands of more resources. trust that you are not the first person to have trouble with these and most people before you have asked online about it as well.
I also highly reccomend grabbing a copy of discrete mathematics and it’s applications by Kenneth Rosen to dig farther into the math. there’s a few other types of asymptomatic notation such os big omega and big theta, even little o, that I didn’t mention here but are useful for comparing functions in slightly different ways. it’s a big book but it starts at the bottom and is generally pretty well written and well laid out.
feel free to dm me if you have questions, I’m always down to talk math and comp sci.
edit: in our example, we could also pick c =19 and n = 1, or probably a few other combinations as well. as long as it fills the definition it’s correct.