I don't think you've failed as an instructor at all. People probably just aren't interested in programming, and don't bother watching the videos, or are still on the first ones. I know I haven't watched 3 or 4 yet because I am still working through the first 2.
Why you aren't becoming a teacher of IT, when you clearly are good at it, and enjoying talking about it, I just don't get. If you don't see this in time, we'll talk tomorrow on the way to Tool, but I mean, you could teach this, or even AI if you taught at the right College... DERP!
@BabblingBrahma :s the problem with teaching computer sciences is that there is absolutely no money in it, from any perspective. The schools don't pay the teachers, and they generally fail to offer resources like textbooks, good computers and required software.
Also, YouTube is catholic. If you type "jesus" and "satin" it will try to correct "jesus" to "Jesus" capitalizing his name, and not "Satin's". Just saying.
Though a quick question: would it be more efficient, in the factorial code, to have the if statement read...
if (n == 0 || n == 1) { return 1;}
I may be missing something and I'm not entirely sure if it would work or not but it seems logical that it would create a more efficient program since it removes an extra recursion from 1 to 0?
@DapeebbStudios I assume you're referring to the Fibonacci since Factorial only has one base case. But the 0 case returns 0, and the 1 case returns 1. So I suppose you could write it as:
if (n==0 || n==1) {return n;}
But checking checking 1 and 0 is not a recursion, so it's not any more efficient.
@MrObviouslyJesus Factorial may only have one base case but !0 = 1 and !1 = 1, would it not make sense to lump them together? (I wasn't sure how to word it but it seems like it would remove an extra boolean check, simplify the code, and save the program from having to go through the fact method again. Wasn't sure why I said recursion.)
I have to admit that I did skip over your previous Java videos due to the length (and I sort of have basic java knowledge already) but recursion was new-ish to me and this was damned helpful.
Kill yourself
LPmelaniphy 5 days ago
I don't think you've failed as an instructor at all. People probably just aren't interested in programming, and don't bother watching the videos, or are still on the first ones. I know I haven't watched 3 or 4 yet because I am still working through the first 2.
WPGxSpork 4 weeks ago
Why you aren't becoming a teacher of IT, when you clearly are good at it, and enjoying talking about it, I just don't get. If you don't see this in time, we'll talk tomorrow on the way to Tool, but I mean, you could teach this, or even AI if you taught at the right College... DERP!
BabblingBrahma 4 weeks ago
@BabblingBrahma :s the problem with teaching computer sciences is that there is absolutely no money in it, from any perspective. The schools don't pay the teachers, and they generally fail to offer resources like textbooks, good computers and required software.
MrBrynUnce 3 weeks ago
Also, YouTube is catholic. If you type "jesus" and "satin" it will try to correct "jesus" to "Jesus" capitalizing his name, and not "Satin's". Just saying.
dwart420 4 weeks ago
@dwart420 It's "Satan". Satin is a type of cloth material.
MrBrynUnce 3 weeks ago
VB.net FTW..jk nice tutorial. you must me jesus.
dwart420 4 weeks ago
@dwart420 Visual Basic is a great language.
MrBrynUnce 3 weeks ago
IHaveNoIdeaWhatImDoing.jpg
Metroid24242 4 weeks ago
Though a quick question: would it be more efficient, in the factorial code, to have the if statement read...
if (n == 0 || n == 1) { return 1;}
I may be missing something and I'm not entirely sure if it would work or not but it seems logical that it would create a more efficient program since it removes an extra recursion from 1 to 0?
DapeebbStudios 4 weeks ago
@DapeebbStudios I assume you're referring to the Fibonacci since Factorial only has one base case. But the 0 case returns 0, and the 1 case returns 1. So I suppose you could write it as:
if (n==0 || n==1) {return n;}
But checking checking 1 and 0 is not a recursion, so it's not any more efficient.
MrObviouslyJesus 4 weeks ago
@MrObviouslyJesus Factorial may only have one base case but !0 = 1 and !1 = 1, would it not make sense to lump them together? (I wasn't sure how to word it but it seems like it would remove an extra boolean check, simplify the code, and save the program from having to go through the fact method again. Wasn't sure why I said recursion.)
DapeebbStudios 3 weeks ago
@DapeebbStudios Two comparisons still have to be made regardless.
MrObviouslyJesus 3 weeks ago
@MrObviouslyJesus Okay. Cool beans. :D Thanks for the assistance. :)
DapeebbStudios 3 weeks ago
Yo Mama's so fat the recursive function calculating her mass causes a stack overflow.
Br1ngTheRain 4 weeks ago
Comment removed
DapeebbStudios 4 weeks ago
I have to admit that I did skip over your previous Java videos due to the length (and I sort of have basic java knowledge already) but recursion was new-ish to me and this was damned helpful.
DapeebbStudios 4 weeks ago
Hooker with a Penis is definitely on my favorite Tool song list. That isn't saying much because every Tool song is on my favorite Tool song list.
KnutRudikle 4 weeks ago
For the fibnoacci method, you can just do if(n ==0 || n==1) return n; it looks a lot smaller lol.
BarcaFTW10 4 weeks ago
I lasted 2min lol
bluedude447 4 weeks ago
3rd :D
orangisorange 4 weeks ago
you are a genius
1035AMC 4 weeks ago