Perseverance is not a long race; it is many short races one after another.
Today I want to compile the tangram-es library for my system and try to run its examples.
After working on the compilation for just thirty minutes, I finished the job, very simple job.
Thanks to the well-organized program and perfect makefile, the job is so easy.
But then I tried to impplement the library with my own application using Qt, I failed to compile my app successfully, there were several header-files that can't be found.
Frustrated, maybe I should be more patient to code for my application with my own solutions.
It isn't a good way to just use other's library, at least I should read their codes first and try to make a clear understanding about how they realized the functions.
A tough lesson in life that one has to learn is that not everybody wishes you well.
From Dan Rather.
Now that there are some people who are willing to see you have lived an extraordinary life, you should try your best to live a more extraordinary life.
That is the best way to answer those people.
How to evaluate an algorithm's performance?
Generally we would analyze it in two dimensions:
The time-efficiency and the space-efficiency.
Considering that the memory-space is not a vital problem in nowadays, so its time-performance would be the very thing that decide whether it is a good algorithm or not.
Please spare some time to read this blog:
How to analyze the efficiency of an algorithm?