Programmers in 1960s: We're NAND gating out of Earth with this one

​​@@RedVio972The AGC is legitimately mind-blowing. It even had a software VM for a machine language to do the linear algebra required for heading calculations (kind of like the JVM but in the sixties, Apollo engineers were truly wild)

Now, now, no need to exaggerate. You're an order magnitude off. The number checking program was 330 GB, not 30 GB.

Charles Moore (creator of the FORTH programming language) all I need is 1K for the operating system. Maybe 12-14 bytes for the program

The 72kb moved the slide rule back and forth.

I hate that I get this reference

didn't he literally do the exact same thing? with a clock or smth

Don't think I get it~ 😅

@@Nessie14 YanDev is infamous for having written some of the worst code in teh gaming industry. For example, Instead of having a logical event handler for the many things that could happen in their game, it's just a GIANT IF/ELSE block

​@@FireSikuand not only that, he'll refuse any help and insists he'll clean it up when he's done, but the longer it goes like that the harder it'll be to clean up, eventually he might as well make a new game

Yes, he used a lesser thing to make a greater one.

​@@flameofthephoenix8395that depends on your definition of lesser and greater

The even worse irony is that you don't even need modulo for this. Assuming your base dimension is even, you can do the check for the last digit only. Here is my entire codeframe (&yes, I'm aware this video is intentional gore and can be 'solved' by checking for the last bit only): #include //the program wants to talk #include //technically superfluous if you check for termination (see below) int main(int argc, char* argv[]){ //the main function needs arguments (and their count) for (short i=1; i

​@@whohan779 You're right about only needing the final bit but all you need to do is a bitwise AND with 0x1 unless there's something I'm missing with this approach: #include int main(int argc, char* argv[]) { if (argc < 2) { fprintf(stderr, "No input number given!"); return -1; //can't be bothered to check all invalid inputs rn lol } int number = atoi(argv[1]); if (number & 0x1) { printf("%d is odd.", number); } else { printf"%d is even.", number); } return 0; }

@@whohan779 my dude, you would never do this, it would be easiest to return the value of the last bit in the integer as a bool It's value of true means odd, and false means even.

But... the binary search needs the division operation, and i think we can implement it thusly: uint32_t divide(uint32_t a, uint32_t b, uint32_t potentialResult=0) { if(potentialResult*b >= a) return potentialResult; return divide(a, b, potentialResult+1); }

Smart!

Definitely! Then you can offload the work to a cluster to take care of the heavy lifting.

...or don't use if statements. Ah wait, this is crackhouse, how about we use IF statements to find which statement?

Second function starting at the highest number going down, add wrapper with bool to indicate if number is propably big, half execution time

move it to the edge!

Show this to the KZfaqr “tech lead” (who admitted to lying about being a former Google tech lead) and watch him try to figure it out. 😂

I’ve worked at a shop that refused to add indexes to the oracle exadata database. They were forcing the issue to purchase in-memory licensing. A million dollar solution before trying the free one.

​@@rahulshah1408 That's... amazing. Was it the shop's idea to do this on purpose? Knowing Oracle, they were probably quite pleased.

more like dev team on crack haha

No more than 2.5 billion in go :(

It's actually using a switch statement would improve performance.

a hashmap of numberboolean would have been faster but not sure about memory

@@rohit-guptaarray of length 4 billion?

​@@t3dotgg3/4 of that would be error handling so closer to 625 million

4,200,000,000 warnings but no errors, if it's good enough for the compiler it's good enough for me. Ship it to prod

@@JetJockey87 For real though: while just building a program that checks the last digit for oddity as a joke I know probably now most of the warnings and errors and can vouch that most of them are valid and deserved.

Did you run the program and then read it or did you read the code and then decided it would be a good idea to run it? :P I'd hide malware on line 8,500.

@@minerscale8543

All I had one of those group projects once we were supposed to each do a specific chunk of the code merge them together and then compile the result. Had one of the people who didn't understand recursion totally rewrite my code which wasn't his job. The project was for a simple calculator. Where you would put it in an equation and it would spit out the answer. We're just talking plus minus times divides no higher functions at all. Well my simple recursive solution was about a page of code. His rewrite took over 20 ft of paper to print out. I refused to take that so I submitted my solution to the teacher as well saying that wasn't my code. I passed with an A

@@Wyld1one was the recursion for processing brackets? That's like the poster child for recursion is it not!

sounds like me XD

I’m gonna try this just for the heck of it. 😂

@@photoniccannon2117 post the results 👀I HAVE to know now

@@nextgenstudios335 See I was thinking about how to do this. Here is problem number 1: I literally don’t have a drive large enough to store the file with the code (I have a hard drive, but that’s way too slow). So I need to get a gigantic SSD first (or find a way to clear space on my Mac). I think the latter is manageable, so we will see.

Should be able to split it into more than one file to avoid having to decompress too much at once.

the file size is only a gb without compression!

A function to add two values with convoluted switch statements to account for all combinations

hell yeah. Imagine how faster computers will be when we can throw away all the ALUs and just lookup the answer for any calculation in a lookup table!

Clear and concise.

If only pi was a function that computed it with the odd reciprocal formula at runtime

@@simono.899Now that would be a sight to see.

First time i understand how things actually work it is kinda dumb that toolchains got so scary for me

I was expecting him to remove new line characters from the file, this way it was just one line...

Would removing beeline characters from the file actually work?

@@finminder2928 C separates commands with ; it treats new-line as any other space. Exception is precompile directives, so a couple of includes would have to be on the line of their own.

Binary search is unnecessary. Can just index directly into the right memory location.

@@OMGclueless Isn't not counting the time spent building an index cheating? And if you do it from a file, then there's still the same issue of file reading speed. If it is counted and still is faster, it's pretty much functionally equivalent to avoiding the self-imposed problem rather than trying to solve it as you go from 4 billion conditions with jumps to read to... 4 billion references in an index. If you use indexing to 'turn' it into a single condition leading to the right condition, then the 4 billion conditions aren't used, so it's cheating as well. Binary search has the advantage of hypothetically being able to use all conditions in two calls. Using all conditions in 4 billion calls seems a bit *too* spread out to not be cheating your way out.

​@@Exilum Mapping a file into memory is a constant-time operation: just setting up a page mapping in the OS. Jumping into the middle of the file and reading the answer there is also a constant time operation, it takes a single page fault to go read the file from disk and map the page you accessed into memory (this step technically takes log time, most likely, since the file's blocks are probably stored in a structure like a btree). Creating the file takes a long time, of course, but you only do it once and then can answer as many queries as you like with no extra work. Re: binary search vs indexing. I think if one is allowed they both are allowed. log(n) operations to find the right answer and 1 operation to find the right answer are both skipping billions of comparisons so both are cheating by just about as much.

@@OMGclueless Hmm, I see your point. I still think think they're far from cheating equally.

@@Exilum Well, look at it this way, binary search skips ~2 billion - 32 comparisons, while indexing skips ~2 billion - 1 comparisons, so the amount of cheating is pretty close :D

Same the compiler class I took was my favorite and I learned so much about programming in that one class. The assembly class which was separate was my 2nd favorite 😊

I have a lot of nostalgia for PIC assembly. I wouldn't do it again but it was a lot of fun. VHDL too.

That's ridiculous. What's next? Using bit rotates and carry flags? Poppycock!

That's actually what the assembly version does by the looks of things, so there you go. :P

It takes only 10 seconds at most, I'd say that is extremely performant and efficient. He's done a very good job. XD

reading that gave me nausea... I love it...

npm is a javascript/typescript package manager. The code was written in c(++) and assembly.

@@codetoil package it as a node script that executes the original program

​@@codetoilwe just need to modify it to produce a 30gb wasm file instead

@@codetoil just write an x86 interpreter in javascript and ship the bin as a blob.

@@codetoilI volunteer you to write a wrapper for it.

the linker would run into the 4gb limit though no?

@@TurtleKwitty uuuh, good point lol, honestly no idea

Wouldn’t it be O(N)?

@@user-hv4nl9rn8t You seem to be conflating 'if' with 'else if'. If statements don't terminate once one outputs True, logically. That's what else ifs do, hence the name, 'else, if......., then .........'

Why stop there? At that point couldn't you easily do 九万九千九百九十九無量大数, just to add more bits to account for? (now I really want to try and see how long that number would be written out)

@@Xudmud In the scale used currently 中数(万進) that's not possible. For every big power you can only go up to 千(10^3) since these powers increment like this: 4, 8, 12 ... 68. Maybe with the 中数(万万進) scale, but with the notation of this scale I am not really familiar. 三千三百三十三無量大数三千三百三十三不可思議三千三百三十三那由他三千三百三十三阿僧祇三千三百三十三恒河沙三千三百三十三極三千三百三十三載三千三百三十三正三千三百三十三澗三千三百三十三溝三千三百三十三穰三千三百三十三𥝱三千三百三十三垓三千三百三十三京三千三百三十三兆三千三百三十三億三千三百三十三万三千三百三十三

@@gomi-hako Whoops, I knew it was 10^3 per but miscounted where that ends up at. (been long enough since I took Japanese and I'm too used to working with 10^2 per big power). So I guess 九千九百九十九無量大数... would be the highest? (it'd add another two or three bits to the numeric value)

What about Googolplex?

smart

In all honesty it is possible that it started with strings like "first", "second", etc, and only then got changed... which would make sense. And let's be honest, there is a slight difference between 31 and 2**32-1.

@@volodyanarchistI’d use an array or at least a switch statement, though…

@@GRBtutorials I agree with switch. But again can think of a caveat. Assume you also have language like russian. First would be первый if it's masculine, первая feminine, первое neuter, первые plural... And also different cases. And you only had 1, 2, and 3. But i would definitely advise anybody to do a multidimensional array. Anyhow, just to be clear, i agree with you, but am trying to find a reason why somebody would do something like that where it made sense at least initially.

That's code generation with self-modifying code. Yeah it's useful sometimes. Beats writing it yourself!

You should write some code that bruteforces that command

Akshually....

‼FUN‼

oh we're still doing this joke format. okay

I spent a lot of time looking at assembly before learning higher level languages like java and it worked out fine for me so I say go for it.

I come from digital electronics - so, logic gates, op amps (for some analog applications) and DSP functions. I built a digital clock before touching an 8080 microprocessor and writing programs to it using its assembly and tracking memory use by pen and paper.... which... you can write more to a sheet of paper than it had memory to work with in many cases. This was all back when Pokemon was 8 bit and taking the world by storm. I highly recommend people learn assembly and make use of it on small scale computers before studying more modern architectures and using higher level languages. It's also recommended to study operating systems, file/drive structures, etc. Speaking of Pokemon, the original red/blue games are highly recommended case studies in programming. On the surface, it all generally works. There are some accidental bugs with how things work vs their intent - but the big ones play out when dealing with the fact that there js a shared memory space between many different parts of the program. The missingno glitch is abaolutely fascinating from a programming perspective and is an example of why coding conventions exist or, in some cases, compilers/languages handle it in the background (and why you might want to, in some cases, not initialize a variable if you know where it's pointed in memory - granted, it's bad practice, but that's what comments are for - when you're performing voodoo rituals). So, in a sense: Logic gates and boolean algebra Possibly op amps for those who want to delve into ancient dark rituals to be able to contract the demons of solomon with mixed signal processing. Then 8080/z80 etc assembly and program mapping. Then C compilers. Then Pokemon code and bug analysis (end by catching mew without tools and/or hacking the game to put mew under the damned truck). Then disc structures Then Operating Systems (start with a command line operating system - dos or something). Then 32 bit computing, risc vs cisc (everything is actually risc - cisc just has schedulers trying to keep the ALUs busy) - which leads us into floats vs ints and some other paradigms. Which is still C, but now we add C++ because larger programs tend to use that next higher level. After that, a programmer can go almost anywhere and do anything at least in terms of core computing. Networking should be a separate step, but require completion of what I consider to be the basic computer course above. Networking is just a lot more involved and not really necessary for most programming. To do it properly, it's both the underlying hardware which facilitates network topologies/protocols, but also the implementation of operating system access controls and accounts. I have a friend who works the helpdesk, mostly for internal issues for the company (they have field agents and customers who also get routed into their ticket system) the network admin got herself locked out of her computer in a situation she was convinced was unrecoverable. People mentioned he'd probably be able to fix it, and of course she was skeptical some help desk goon from a community college could undo a problem her networking degree couldn't solve. He just used basic system tools and 5 minutes to have her password wiped and her account ready to be claimed. The look on her face was that of abject horror. People are not being taught the basics and don't have the tools to solve their problems - which gives them a warped and distorted view of the present standards/claims of products.

that last statement in this comment is pretty much exactly what i have feared for the past decade or so. Like sure i could mimic whats done in a high level java script or python course and be able to output the desired results, but i hated not knowing how it was even possible to get to that point. I also know that harvards cs50 is an excellent resource to get started but even that doesnt have this level of what i guess could be called first principle knowledge. Im sure what you outlined isnt something that could be thoroughly grasped from 0 over the course of just a year or so but it has that "Nand to tetris" route where i feel the most vital information will be learned. @@Aim54Delta

Many of these weird limits are in place for backwards/legacy compatibility - maxpath is still from windows 95 days, short 8.3 filenames from dos days. Microsoft really doubles down and excels in maintaining compatibility for decades; enterprises tend to demand this even if it sometimes doesn’t make sense but their crappy custom, no longer supported (because vendor went belly up) ‘business critical’ applications. You can disable maxpath btw, but then random applications might go flaky…

Moving thep roject as a whole is kinda funny, at one of my jobs the antivirus would delete anything that looks like code or executables not on whitelist outside of specific folders deep inthe hierarchy (246 characters deep without the name of the project) so we instead had a special route whitelisted that allowed us to put shortcuts in a root folder XD Doing a deep scan of filesystems for a project that needed to to so still lead to a lot of issues so I had to actually use shortcuts as file pointers in that directory, the memory thrashing of recreating shortcuts for every folder on as it explored was wildddddd

Quantum computers, that can somehow do all of those ifs at the same time.

Well the first way of checking if a number is odd or even id think of is through evaluating the validity of an Equation (N(some Number) ÷ 2 (smallest even number) = Int(an integer which cannot possess any odd Numbers when divided By 2 as as any odd number when divided will always either produce a reminder which we could evaluate or create Decimal Places so instead I'm checking if the Equation itself is Valid rather then directly working with the result (Data validation so if it divides an odd Number the Equation becomes invalid as the result Of the Equation isn't an Integer

Been a while since I last coded anything but if you just wanted to know if a number is odd or even, you could just look at the last bit (of a 32 bit int so no need to guess the length) and spit out an answer, which will be way faster than the modulo operator. last bit 0 = even last bit 1 = odd This obviously wouldn't work for any other multiple like %3 or %4 but neither would the if-else monstrosity.

Yup!

You don't need to go to assembly level to do that, C has bit manipulation bool is_odd = x & 1;

@@Andoxico Fair enough i was just saying if we are gonna go to that extreme might as well do it the most effective way