Project - Stage 2.1 - Project Optimize 1

Previous Reading

Project Optimize Plan

The First Algorithm Improvement

Bit operation only needs an instruction cycle to complete, and most of the C compiler "%" operation is to call subroutines to complete, the code is long, slow execution speed. In general, as long as the remainder of 2n square is sought, the method of bit operation can be used instead.

codewordmask.c



size % 4 size & 3




Comments

Post a Comment

Popular posts from this blog

Hacktoberfest - My 3rd

Image
This is the third contribution I have made for Hacktoberfest. It is a rent web application with forms. The issue can be found here . When I looked at this application, I tried to finish some form. I am not familiar with this content. So I am not match all the requirement to finish the form. I received some hits. However, I have no idea which one is flat name and which one is base rent. Here is the pull request I have made. I add some text just before the input area. Those fixes are quite simple, However, it improve the users' experience a lot I think. I learned sometimes we should pay more attention to the user's experience.
Read more

Algorithm Selection Lab

Background This lab is to help understanding software optimize. As technique developing, the contents a software can be represented are rich. We use more high quality images, audios and videos. High quality means more space need, less battery usage. The mission is to find the balance between them. Example: Basic Sound Program aarchie server vol.h #define SAMPLES 5000000 vol1.c // Function to scale a sound sample using a volume_factor // in the range of 0.00 to 1.00. static inline int16_t scale_sample(int16_t sample, float volume_factor) {         return (int16_t) (volume_factor * (float) sample); } int main() {         // Allocate memory for large in and out arrays         int16_t*        data;         data = (int16_t*) calloc(SAMPLES, sizeof(int16_t));         int ...
Read more