|
i just can't agree. penis clearly != no penis.
|
#
?
Jun 9, 2017 04:49
|
|
|
|
| # ? Apr 26, 2024 19:04 |
|
|
especially in computer programming judging by gender balance
|
|
#
?
Jun 9, 2017 04:49
|
|
|
RobobTheGreat posted:*or* if P=0 gently caress you're right, I guess that means it's twice as likely then
|
|
#
?
Jun 9, 2017 10:39
|
|
|
flakeloaf posted:so what you're saying is that distance learning data structures and algorithms is going to make me doubt the "ignore it for 5 months and then do the entire curriculum in 3 weeks" strategy i just finished a distance learning bachelors in compys and this post gave me a bit of the old terrors
|
|
#
?
Jun 9, 2017 12:16
|
|
|
If n is one or p is 0 p=np. Stupid comp sci idiots.
|
|
#
?
Jun 9, 2017 14:57
|
|
|
SpaceClown posted:If n is one or p is 0 p=np. Stupid comp sci idiots. this joke was already done. mods ban this chucklefuck
|
|
#
?
Jun 9, 2017 15:38
|
|
|
flakeloaf posted:i'm doing one right now and the book is incomprehensible cs texts are lol and a racket. unless the material and tests closely follow it find a bunch of other resources as supplement. our course used sedgewick which is worthless for a good portion of the class. he invents his own notation which no one uses because he has problems with Big O - but his problems are addressed with theta and omega, which i guess he never heard of. visualizations are good (animations, graphs (assuming proper scales) etc) for an intuitive understanding of things. the math you just have to keep hammering at until you recognize patterns and strategies and then everything is almost mechanical OldAlias fucked around with this message at 19:09 on Jun 9, 2017 |
|
#
?
Jun 9, 2017 18:50
|
|
|
Symbolic Butt posted:this joke was already done. mods ban this chucklefuck why did the chicken cross the road? to get to the other side 
|
|
#
?
Jun 9, 2017 19:02
|
|
|
OldAlias posted:cs texts are lol and a racket. unless the material and tests closely follow it find a bunch of other resources as supplement. our course used sedgewick which is worthless for a good portion of the class. he invents his own notation which no one uses because he has problems with Big O - but his problems are addressed with theta and omega, which i guess he never heard of. everything i know about algorithms comes from this: https://www.youtube.com/watch?v=kPRA0W1kECg
|
|
#
?
Jun 9, 2017 19:15
|
|
|
OldAlias posted:cs texts are lol and a racket. unless the material and tests closely follow it find a bunch of other resources as supplement. our course used sedgewick which is worthless for a good portion of the class. he invents his own notation which no one uses because he has problems with Big O - but his problems are addressed with theta and omega, which i guess he never heard of. what was his notation like? I remember it was just kind of vague, less formal. "This algorithm is n log n", like that
|
|
#
?
Jun 9, 2017 20:20
|
|
|
f ~ g. it's basically theta, but if f ~ g then f / g -> 1 (in theta the implied constant is arbitrary)
|
|
#
?
Jun 9, 2017 20:28
|
|
|
if p = np when n is 1 or p is 0 then clearly p = np because those are the only two numbers that exist, duh
|
|
#
?
Jun 9, 2017 21:26
|
|
|
Sweevo posted:everything i know about algorithms comes from this:
|
|
#
?
Jun 9, 2017 22:19
|
|
|
Captain Foo posted:if p = np when n is 1 or p is 0 then clearly p = np because those are the only two numbers that exist, duh what if p = 1 and n = 0, op
|
|
#
?
Jun 9, 2017 22:20
|
|
|
an abelian grape!!! ahahahahaha
|
|
#
?
Jun 9, 2017 22:39
|
|
|
Endless Mike posted:what if p = 1 and n = 0, op JMPs to a flag that only contains HCF
|
|
#
?
Jun 9, 2017 23:37
|
|
|
Bloody posted:lol yeah whats up w/ that there are only two wavelengths that photosynthesis utilises i believe, and the rest goes to waste ?
|
|
#
?
Jun 10, 2017 03:53
|
|
|
they called the second photosystem photosystem one
|
|
#
?
Jun 10, 2017 03:57
|
|
|
photosystem 360
|
|
#
?
Jun 10, 2017 03:59
|
|
|
Elysiume posted:whenever I see this video linked I leave it on in the background because some of the algorithms sound so good. merge sort with with bip bip bip bworp bwooorp radix sort sounds super cool (and also appears to be the fastest)
|
|
#
?
Jun 10, 2017 08:49
|
|
|
Did u know selection and insertion sort are actually the same? #wow #whoa https://www.youtube.com/watch?v=pcJHkWwjNl4
|
|
#
?
Jun 10, 2017 09:26
|
|
|
Sagebrush posted:radix sort sounds super cool (and also appears to be the fastest) it reminds me of the weird soundtrack towards the end of earthbound
|
|
#
?
Jun 10, 2017 11:34
|
|
|
Endless Mike posted:what if p = 1 and n = 0, op stack underflow
|
|
#
?
Jun 10, 2017 22:12
|
|
|
did u kno, there are other complexity classes besides p and np. its true
|
|
#
?
Jun 10, 2017 22:22
|
|
|
Lutha Mahtin posted:did u kno, there are other complexity classes besides p and np. its true nobody cares though
|
|
#
?
Jun 10, 2017 23:37
|
|
|
spankmeister posted:Did u know selection and insertion sort are actually the same? #wow #whoa the scratching sounds always bother me in these videos, gently caress. and those animations are a little bit too much but what matters: I guess that they're the "same" in the sense that insertion sort is just a better tweaked version of selection sort. maybe something to do with dynamic programming? I'm surprised that I never heard about this before but then again I didn't do a BS CS Symbolic Butt fucked around with this message at 01:52 on Jun 11, 2017 |
|
#
?
Jun 10, 2017 23:47
|
|
|
Captain Foo posted:nobody cares though aside from the people who actually understand complexity classes lol
|
|
#
?
Jun 11, 2017 00:23
|
|
|
yeah but this thread isnt for people who understand stuff. its for shower thoughts about a wikipedia article i read and beeping noises that soothe the autism
|
|
#
?
Jun 11, 2017 00:46
|
|
|
pram posted:yeah but this thread isnt for people who understand stuff. its for shower thoughts about a wikipedia article i read and beeping noises that soothe the autism Please post more beeping noises.
|
|
#
?
Jun 11, 2017 02:46
|
|
|
Symbolic Butt posted:the scratching sounds always bother me in these videos, gently caress. and those animations are a little bit too much selection sort basically does the exact same thing every time. it always does θ(N^2) comparisons, which is bad, but also always does O(N) writes to the array, which is good insertion sort is sensitive to the input. it can do O(N^2) comparisons and O(N^2) writes to the array in the worst case, which is bad, but if the array is close to sorted already then it does O(N) comparisons and O(N) writes and has fantastic locality, which is all very good thanks for taking my post, i'll hang up and listen
|
|
#
?
Jun 11, 2017 06:17
|
|
|
just do .sort() in whatever language you use until your profiling and testing say its too slow then google a bunch and copy code until its faster.
|
|
#
?
Jun 11, 2017 13:42
|
|
|
Or "order by " in your database of choice.
|
|
#
?
Jun 11, 2017 13:42
|
|
|
Lutha Mahtin posted:aside from the people who actually understand complexity classes lol pram posted:yeah but this thread isnt for people who understand stuff. its for shower thoughts about a wikipedia article i read and beeping noises that soothe the autism traveling salesman goes bep bep
|
|
#
?
Jun 11, 2017 14:11
|
|
|
There is only one but very important reason to ever know algorithmic things and that is to get through dumb job interviews designed by autists
|
|
#
?
Jun 11, 2017 18:44
|
|
|
if you don't have at least a basic understanding of asymptotic analysis then you're a terrible programmer
|
|
#
?
Jun 11, 2017 19:02
|
|
|
OldAlias posted:if you don't have at least a basic understanding of asymptotic analysis then you're a terrible programmer No loving poo poo dude but like that's absolutely the lowest of bars
|
|
#
?
Jun 12, 2017 09:03
|
|
|
Just interested, why is it bad that an algorithm takes longer that the lifetime of the universe to complete? Anyone? Oh well then.
|
|
#
?
Jun 12, 2017 09:04
|
|
|
did you know that there exists some numbers — and these are real, normal numbers — which take more bits of information to express than there are atoms in the universe
|
|
#
?
Jun 12, 2017 10:20
|
|
|
one such number is nextup(0.0) another one is nextup(nextup(0.0)) it should be obvious just by inspection that neither of those numbers can be expressed nor computed, in P or NP
|
|
#
?
Jun 12, 2017 10:37
|
|
|
|
| # ? Apr 26, 2024 19:04 |
|
|
see, this is the sort of nonsense which one gets around by having complexity classes defined exclusively by yes/no problems. not that the statement above makes much sense either way, but clearly one wants to separate between something being difficult to compute in a deeper sense, and something taking a long time to do because the output demanded is large
|
|
#
?
Jun 12, 2017 10:55
|
|
