You're welcome! Glad to be of help :)

Hello and thank you for your comment! Yeah, I see where you're coming from. It can definitely be a sign of the golden hammer antipattern. Having said that, in the real world some situations may call for doing this (eg. already having an existing codebase and not wanting to spend the time to convert it, or wanting to have a cross-platform solution). Plus, I wouldn't necessarily say that HTML isn't designed for GUI. I've used both TkInter and JavaFX a fair bit and I'll say It's just another approach for doing GUI. They all have their learning curve and pros and cons. I don't think any user of tools like Eel, Electron or Cordova that wraps a web application as GUI for a standalone program would deny it's a hack. Sometimes it's just the path of least resistance and the time saved from doing this could be used in better ways.

Hello and thank you very much for your comment! Glad you liked the video :)

Hello and thank you for your comment! Yes, if you have a 16x16 LED matrix and you stick to the same 8-bit shift registers, you'll need four of them. However, Arduino's shiftOut() is designed to work with bytes (8 bits), so realistically, you're going to either have to call shiftOut() twice to shift 16 times, or you'll have to roll your own equivalent function. By the way, that's a 16-bit number you're looking at, so the range goes up to 65535, not just 511!

Heh, yep, made it my entire brand!

Hello and thank you very much for your comment! No professorship unfortunately, but I _do_ start lecturing at the degree level next year :)

where at???

Well, I'm based in Singapore so I'll just say it's one of the private universities here. Don't think I want to say any more than that on the internet!

Hello and thank you for your comment. Yes, zip bombs can be dangerous anywhere, as long as the software decompressing it doesn't correctly guard against this and "unpacks" the archive indiscriminately. Legitimate applications will not contain zip bombs, so there isn't a "real function" so to speak. These are exploits on compression algorithms designed to cause crashes and disrupt regular operation.

Hello and thank you very much for your comment! Glad you liked the video :)

You're welcome! Very happy to be of help =)

Hello and thank you for your comment and support! Glad you like my work =)

You're welcome! Glad you liked the video =)

You're welcome! Very happy to be of help =)

Hello and thank you for your comment! Glad you liked the video =)

Hello and thank you very much for your comment! Glad to be of help =)

Thank you very much for sharing! Both are FOSS as well, which is doubly great! EDIT: Comment pinned and links to the two programs added to the description!

Hello and thank you very much for your comment! Glad you found the video useful =)

Hello and thank you for your comment! Yes indeed, lots of pretty smart features!

@@NERDfirst just realised it was 9 years ago sorry lol

Hello and thank you for your comment! Unfortunately command-line interfaces aren't for everyone. Not to mention that video encoding is a complex topic as well. If you're looking for a non-command line equivalent, you may want to consider software like Handbrake. I haven't used it myself but people seem to like it!

@ too late, I figured it out

Hello and thank you for your comment! If you're talking about being "insane" at CS, that takes time. One year isn't much in the grand scheme of things. There's a long-time saying that it takes 10000 hours of practice to become at expert at something. While this is debated, it hopefully helps define the scale of the amount of effort required. There's another point to make as well - I didn't come up with this algorithm. Most people use algorithms invented by someone else. In Computer Science, many things fall into "standard patterns" that can be addressed by pre-existing algorithms. It sounds like you're a second year CS student, so you might not have had many chances to look into the standard Data Structures and Algorithms that exist out there, but that'll come.

@@NERDfirst right now im doing DS1 also how do u think like a programmer because for DS im thinking kinda visually

There's nothing wrong with thinking visually. A lot of the time, we actively encourage it as a teaching/learning tool. In fact many algorithms like Linked Lists, Trees and Graphs actively require you to visualize an abstract problem in graphical terms. It's only an issue if you find that you can't "convert" the pictures in your mind to an algorithm. That typically indicates that your fundamentals aren't strong enough and you might need to revisit concepts or get in more hands-on practice so you can improve on your computational thinking.

@@NERDfirst how about you how do you think like a programmer ?

Honestly, I don't go out of my way to think about things in a special way. A lot of Computational Thinking frameworks will list techniques like problem decomposition, and pattern and abstraction recognition. I realize that I apply a lot of these subconsciously, but actively trying to do them in a vacuum can also be challenging. You can read up more on the topic of Computational Thinking if you're interested, but again, I don't feel that thinking about these techniques in the abstract are really helpful. At least, not more so than just getting the practice in. Start with very simple problems and work your way up.

Hello and thank you very much for your comment! Very happy to be of help, and you have a great day too =)

Hello and thank you for your comment! Good point, I don't think I ever explicitly defined the two terms. Here's my definition, which I hope helps complete your understanding: Sampling refers to taking periodic measurements of a signal. Typically, we would sample an analog signal, allowing the samples to be saved digitally, with the intent of recreating that signal using those sample points. Sampling rate simply refers to how often each sample is taken. It is measured as the number of samples taken per second, with the unit Hertz (Hz).

Thanks for sharing! Scrcpy has a bunch of useful keyboard shortcuts that I can never remember.

You're welcome! Glad you liked the video =)

You're welcome! Glad to be of help =)

Hello and thank you very much for your comment! Glad to be of help =)

Hello and thank you for your comment! This isn't generally something that can be easily done. I wouldn't be surprised if even calculators use approximations or look-up tables. But if you wanted to do it anyway, the method is described in detail here: math.stackexchange.com/questions/4680996/find-arctan-without-calculator

You're welcome! Glad to be of help =)

You're welcome! Very happy to be of help, and thank you very much for the support =)

Hello and thank you for your comment! Could you elaborate more on your use case? Since Android phones don't ship with a command line by default, there's no easy way for an end-user to use FFMPEG on Android. You could go through a third-party user interface on the app store, though those are not official, so you may have to put up with ads or whatever else those programs ship with. You could install Termux and run the official FFMPEG via the Termux command line. That's what I do, personally if I ever need to run FFMPEG on my phone, but if you're _only_ using it for FFMPEG it's not exactly worth the effort. Another possible use case is if you are an Android app developer and want to embed FFMPEG as part of your app. I've never done this but it is fairly common among developers whose apps need to work with video.

Hello and thank you very much for your comment! Glad you liked the video =)

Hello and thank you for your comment! The two concepts are similar - Checksums and check digits are both values calculated from data, with the purpose of acting as a "second opinion" to ensure that the data is "right". The key difference with a check digit is that it starts off as a checksum, but then you do some more computation to it to turn it into a single letter or digit, and add it to the data itself. So check digits often appear in places like ID numbers, credit card numbers, car registration numbers and the like, and is contained within the data itself (eg. The last digit of a credit card number is the check digit, but in daily use, we wouldn't know. It's just "there" as part of the number!) When we say "checksums" broadly, they may or may not be included directly in the data like this. For example, in TCP/IP (used in loading web pages), each "packet" has a checksum included as part of the packet, but separately from the data.

@NERDfirst Thank you sm! very helpful explanation

You're welcome! Glad to be of help =)

Hello and thank you very much for your comment! I'm quite surprised the links aren't dead either seeing as they haven't been updated for over a decade!

You're welcome! Glad to be of help =)

Hello and thank you for your comment! Yep, that works!

You're welcome! Glad to be of help =)

Hello and thank you very much for your comment! Glad you liked the video, and yeah it's a really intuitive program so it's unfortunate that it didn't go further than it did.

Hello and thank you for your comment! Noise generally doesn't factor into this, as you are just repeating a single tone. If it sounds harsh or clicky, double check your start and end points to ensure that you haven't selected any more than exactly one repetition. I think your best bet is to try with a different part of the sound if one part just doesn't work.

Hello and thank you for your comment! Glad to be of help, here's wishing you'll do well =)

You're welcome! Glad to be of help :)

Hello and thank you for your comment! Yes, indeed, there's no improvement in terms of worst case Big O time complexity. The advantage of this technique is that it increases the likelihood of an early termination. Consider the following data set: 2, 3, 4, 5, 6, 7, 8, 1 If you're using regular old bubble sort, it moves the "1" by one position with each pass, necessitating a full _n_ passes to get everything in place. Cocktail sort on the other hand, gets the job done by the second pass, so assuming that we have mechanisms in place to detect a sorted list, three full passes is all it takes before the algorithm terminates. So cocktail sort is more about allowing more combinations of input to achieve early termination, and less about changing the worst case.

You're welcome! Glad to be of help :)

You're welcome! Very happy to be of help =)

You're welcome! Glad to be of help =)

Hello and thank you for your comment! Glad to be of help, here's wishing you'll do well =)

You're welcome! Happy to be of help =)

You're welcome! Glad to be of help =)

Hello and thank you very much for your comment! Glad you liked the video :)

Hello and thank you for your comment! I never knew this was much of a requirement (and the trend seems to be flashy backgrounds, so I've been moving towards that in recent years). Regardless, I'm glad this was helpful for you!