|
Symbolic Butt posted:entity component system you know how in like a dynamic language you can whack poo poo together? that but c++
|
#
?
Sep 16, 2018 22:58
|
|
|
|
| # ? Apr 24, 2024 00:24 |
|
|
quote:given a list n = 100,000, how many sequential searches must be done before sorting the list and doing binary search is better in terms of number of comparisons? If I understand this poo poo correctly, I wrote an inequality showing the Big O notation for doing a sequential search on the left side and the Big O notation for selection sort + binary search... O(n) <?> Θ(n^2)+ O(n) Am I on the right path?
|
|
#
?
Sep 16, 2018 23:38
|
|
|
also the only people who benefit from weed out courses are the inept and incapable teachers who run them
|
|
#
?
Sep 16, 2018 23:51
|
|
|
tef posted:also the only people who benefit from weed out courses are the inept and incapable teachers who run them Also the teachers who teach later courses and get a smaller entry population (and one that's guaranteed to know whatever bullshit shibboleths the department considers important-enough to embed in the weed-out courses)?
|
|
#
?
Sep 17, 2018 00:04
|
|
|
ctps: thinking about giving up on my rust side thingy again, again like the roadblocks have been numerous i mean this time i've learned lifetimes + borrowing well enough to know how to express the code i want but oh god: <'a, 'b:'a, K: 'a + Eq + Hash + Sync + Send: V: 'a + Clone + ToOwned + Sync+ Send>
|
|
#
?
Sep 17, 2018 00:07
|
|
|
white sauce posted:If I understand this poo poo correctly, I wrote an inequality showing the Big O notation for doing a sequential search on the left side and the Big O notation for selection sort + binary search... you're kinda right, except n isn't the variant any more. they specifically say n = 100,000, so instead you calculate k so that k O(n) = n^2 + k (O(log n)) because that's the breakeven point
|
|
#
?
Sep 17, 2018 00:13
|
|
|
realistic programming weed out course: 1 question, 1 year to answer: why is my sbt build failing consistently 1 in every 4 times? alt: to pass get 3 of your peers to quit the course using only intellectual snobbery and imposter syndrome
|
|
#
?
Sep 17, 2018 00:14
|
|
|
debase yourself and code in go
|
|
#
?
Sep 17, 2018 00:15
|
|
|
gonadic io posted:do they want worst case or average case? don't mix the two. also binary search is O(log n) worst case
|
|
#
?
Sep 17, 2018 00:35
|
|
|
also lol at teaching sorting using O(n^2) algorithms. that's like teaching driving with a horse and cart
|
|
#
?
Sep 17, 2018 00:39
|
|
|
yeah, just use the standard library
|
|
#
?
Sep 17, 2018 01:21
|
|
|
A bit of theory is never a bad thing to have, but the conflation of computer programming and computer science is silly and self-defeating. The first step to learning how to build a cabinet is not designing a hammer from scratch.
|
|
#
?
Sep 17, 2018 01:39
|
|
|
Peeny Cheez posted:A bit of theory is never a bad thing to have, but the conflation of computer programming and computer science is silly and self-defeating. The first step to learning how to build a cabinet is not designing a hammer from scratch. I dunno if I’d go that far. I can understand the argument that maybe there’s a lot of theory front-loaded in computer science like what was posted above, but the value of doing things like reimplementing sort algorithms is that you can actually start to get a real feel for how big-O notation not only relates to real world scenarios, but conversely how to use it as a shorthand for understanding why your bespoke business logic runs like crap when it happens to have three nested loops spread over five functions in the stack. Sure no programmer ever uses a hand rolled sort function when the standard library will do, but it’s probably the best way to really see the difference between O(n^2) and O(n log n) for the novice.
|
|
#
?
Sep 17, 2018 02:09
|
|
|
lol if you didn't learn sort functions by implementing graphical versions of them using BGI in Turbo Pascal in high school
|
|
#
?
Sep 17, 2018 05:05
|
|
|
lol if the school u went to could afford sorting functions
|
|
#
?
Sep 17, 2018 05:12
|
|
|
programming and computer science go hand in hand teaching programming without theory or theory without programming is bad
|
|
#
?
Sep 17, 2018 10:50
|
|
|
comedyblissoption posted:teaching programming is bad
|
|
#
?
Sep 17, 2018 10:52
|
|
|
comedyblissoption posts considered harmful.
|
|
#
?
Sep 17, 2018 10:53
|
|
|
comedyblissoption posted:programming bad
|
|
#
?
Sep 17, 2018 10:58
|
|
|
Beamed posted:lol if the school u went to could afford sorting functions This was the only way we could afford to sort things: https://youtu.be/lyZQPjUT5B4
|
|
#
?
Sep 17, 2018 11:46
|
|
|
Beamed posted:lol if the school u went to could afford sorting functions lol if the school u went to didn't lock the computers down so hard all .exes had to be on an allowed list to even run
|
|
#
?
Sep 17, 2018 14:21
|
|
|
are you ready for some NSTableViews
|
|
#
?
Sep 17, 2018 14:28
|
|
|
Luigi Thirty posted:are you ready for some NSTableViews gently caress yeah I'm ready
|
|
#
?
Sep 17, 2018 14:40
|
|
|
sorry to be making GBS threads up the lovely thread with my poo poo posts but...quote:We'd like to figure out how many work units this algorithm performs. First let's think about how many times the outer loop is run. for i = 0 to length(A) will run from i = 0 to i = n-1, where n is the length of the array. This is a total of n iterations. So now we know that the body of the inner loop will be run n times. is this a typo and did they mean the body of the outer loop is being run n times?
|
|
#
?
Sep 17, 2018 15:40
|
|
|
white sauce posted:sorry to be making GBS threads up the lovely thread with my poo poo posts but... imo- yes, and yes.
|
|
#
?
Sep 17, 2018 15:43
|
|
|
carry on then posted:lol if the school u went to didn't lock the computers down so hard all .exes had to be on an allowed list to even run yeah you had to rename .exes to notepad.exe or they wouldn't work.
|
|
#
?
Sep 17, 2018 15:44
|
|
|
paying hundreds of thousands of dollars for an education in a place where the material's aren't proofread feels good man 
|
|
#
?
Sep 17, 2018 15:52
|
|
|
You just need to drag and drop the exe into a word document then double click on it to execute it via the OLE container. Easy peasy.
|
|
#
?
Sep 17, 2018 15:54
|
|
|
white sauce posted:sorry to be making GBS threads up the lovely thread with my poo poo posts but... I don't think it's a typo just lovely wording // outer loop for I = 0..n { // inner loop for j = 0..m { butts } } You know that the inner loop gets run n times E: it sounds like it's setting you up for deriving that your algo is O(n^2) gonadic io fucked around with this message at 17:21 on Sep 17, 2018 |
|
#
?
Sep 17, 2018 17:18
|
|
|
white sauce posted:paying hundreds of thousands of dollars for an education in a place where the material's aren't proofread welcome to the real world where nothing is proofread
|
|
#
?
Sep 17, 2018 17:27
|
|
|
gonadic io posted:I don't think it's a typo just lovely wording Yeah this. Bloody posted:welcome to the real world where nothing is proofread My course materials were proofread. Because I paid my own money to have people do it 
|
|
#
?
Sep 17, 2018 18:13
|
|
|
DONT THREAD ON ME posted:does jblow have fans within the game industry or is his club made out of gamers and aspiring game devs? i get the impression he's like a mini-notch who had a hit with braid, and he has a little devoted fanbase today because he streams on twitch
|
|
#
?
Sep 17, 2018 19:17
|
|
|
he's from that short era of hipster platformers when game journalists were treating every indie game like a work of high art https://www.youtube.com/watch?v=oc26EKhZNyM
|
|
#
?
Sep 17, 2018 19:25
|
|
|
jblow's best friend is Casey Muratori A dude who I'm convinced hates computers more than mr blow, but is smart enough to know that making his own language won't solve jack squat. elite_garbage_man fucked around with this message at 20:25 on Sep 17, 2018 |
|
#
?
Sep 17, 2018 20:22
|
|
|
elite_garbage_man posted:jblow's best friend is Casey Muratori sorry I know that this is a person but not the significance of this person, explain?
|
|
#
?
Sep 17, 2018 20:25
|
|
|
elite_garbage_man posted:A dude who I'm convinced hates computers more than mr blow at least his heart's in the right place
|
|
#
?
Sep 17, 2018 21:44
|
|
|
C Kotlin S: pretty rad i guess There's such a major difference in feel between coding in python and kotlin and I'm not sure how much is the typing and how much is the language but it's been an enjoyable experience porting over a small python project. There seems to be minimal boilerplate and holy crap the IDE provides a ridiculous amount of discoverability. Strict typing seems to force you to think through design decisions much more thoroughly early on. However, after completing the port of the basic functionality and algorithms (super pleasant and good after sorting out How to Use A Gradle) I decided to try some GUI development with TornadoFx/JavaFx since I've only done webdev. Turns out learning to building UIs is an awful process and I hate it and apparently I'm supposed to litter my Beautiful Bespoke Domain Model with ugly JavaFX properties just so stuff updates on the screen when it's supposed to?? In short are there any good resources on how to use these tools like not a god damned plang idiot?
|
|
#
?
Sep 18, 2018 00:46
|
|
|
Fixing this database has turned me into the db janitor I came here to write software damnit
|
|
#
?
Sep 18, 2018 00:50
|
|
|
Kilometres Davis posted:Fixing this database has turned me into the db janitor I came here to write software damnit this is why I'm afraid to reveal my sql knowledge at work
|
|
#
?
Sep 18, 2018 00:55
|
|
|
|
| # ? Apr 24, 2024 00:24 |
|
|
the first programming thing i learned was regular expressions. i was 9 or 10 years old at the time - my dad taught me. to this day i maintain that it really wasn't a bad place to start thinking abstractly about a single symbol being a representation of some other set of symbols. i didn't learn anything about state machines until over a decade later though.
|
|
#
?
Sep 18, 2018 01:26
|
|
