This media is not supported in your browser
VIEW IN TELEGRAM
๐ Switching editing software
Some of you might've already known this, but I've been actively learning DaVinci Resolve the past couple days.
And I'm happy to announce, I actually really enjoy that editor. Compared to Adobe Premiere, which I trashtalked really bad in my very first edit, it's comfortable and fun to learn. Many monotonous tasks I had to carry out in Vegas manually are nicely automated and polished. These improvements will help me focus on something cooler and give me extra motivation to continue learning.
I'll be moving to Davinci Resolve from here on out, and I might never return to Vegas ever. So yea, pretty cool and historic for the Enderman channel.
The production quality of my videos will definitely grow, because compared to Vegas it's actual professional editing suite used even in Hollywood.
Oh, and the attachment is my first complete edit in DaVinci Resolve.
Some of you might've already known this, but I've been actively learning DaVinci Resolve the past couple days.
And I'm happy to announce, I actually really enjoy that editor. Compared to Adobe Premiere, which I trashtalked really bad in my very first edit, it's comfortable and fun to learn. Many monotonous tasks I had to carry out in Vegas manually are nicely automated and polished. These improvements will help me focus on something cooler and give me extra motivation to continue learning.
I'll be moving to Davinci Resolve from here on out, and I might never return to Vegas ever. So yea, pretty cool and historic for the Enderman channel.
The production quality of my videos will definitely grow, because compared to Vegas it's actual professional editing suite used even in Hollywood.
Oh, and the attachment is my first complete edit in DaVinci Resolve.
5๐87โค17๐10๐1
๐ How Apple blasted the competition with their iPhone
Above are the slides from a 2007 Nokia emergency meeting presentation.
Above are the slides from a 2007 Nokia emergency meeting presentation.
๐ค90๐14๐8๐ฑ6โค4๐ข1
This media is not supported in your browser
VIEW IN TELEGRAM
๐คฌ118๐ค7๐ฑ6๐ข6๐2
๐คฏ The first successful AI pull request
Yesterday a person submitted a low-level optimization PR written 99% by DeepSeek-R1.
Is it over for software engineers, boys?
Yesterday a person submitted a low-level optimization PR written 99% by DeepSeek-R1.
Is it over for software engineers, boys?
๐ฑ105๐13๐ข10๐5โค2๐2
๐ฎ Counting days in a month
I was tired of lookup tables so I came up with this optimized algorithm counting days in a month. The operations seem simple enough, and the โ3 can be replaced with a constant. To me it seems like the bottleneck of the algorithm is all the float operations. The rest can be very elegantly optimized with bitwise.
Super lenient on storage, but slightly more complex in computation. Developers, what do you think about this?
I was tired of lookup tables so I came up with this optimized algorithm counting days in a month. The operations seem simple enough, and the โ3 can be replaced with a constant. To me it seems like the bottleneck of the algorithm is all the float operations. The rest can be very elegantly optimized with bitwise.
def days(y, m):
if m == 1:
return 28 + int(y % 4 == 0)
p = m / sqrt(3)
return 31 if p - floor(p) < 0.5 else 30
Super lenient on storage, but slightly more complex in computation. Developers, what do you think about this?
โค51๐8๐ค6๐1
Enderman
๐ฎ Counting days in a month I was tired of lookup tables so I came up with this optimized algorithm counting days in a month. The operations seem simple enough, and the โ3 can be replaced with a constant. To me it seems like the bottleneck of the algorithmโฆ
๐ The boring way
Well, for one, I fucked up the leap year check, because I didn't know they are skipped every century unless the year divisible by 400.
Float operations are obviously super slow, and even though my solution was mathematically elegant, I think basic comparisons are way to go for time optimization... Shame
I'd actually bet my money this approach is slightly more optimized than a lookup table, if we consider storage:
Well, for one, I fucked up the leap year check, because I didn't know they are skipped every century unless the year divisible by 400.
Float operations are obviously super slow, and even though my solution was mathematically elegant, I think basic comparisons are way to go for time optimization... Shame
int days(int y, int m) {
if (m == 1)
return 28 + ((y & 0b11) == 0 && (y % 100 != 0 || y % 400 == 0));
if (m == 3 || m == 5 || m == 8 || m == 10)
return 30;
return 31;
}I'd actually bet my money this approach is slightly more optimized than a lookup table, if we consider storage:
const int lookup[12] = { 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
int daysLookup(int y, int m) {
return lookup[m] + (m == 1 && ((y & 0b11) == 0 && (y % 100 != 0 || y % 400 == 0)));
}โค27๐ค10๐5
This media is not supported in your browser
VIEW IN TELEGRAM
๐ค76โค10๐ฑ8๐3๐3๐คฌ2