programming
programming stuffs
This section is about programming. Most of the subsections are detailing programming languages that I have used.
Navigating
C/C++ programming languages information
eclipse IDE shortcuts and tips
java programming language
javascript programming language
prolog and prolog-like laguages
REST integration architecture
version control systems
Learning programming
Codingame is a nice tool for learning many languages such as Java, Javascript, C and others.
Common concepts
P vs NP problems: P problems are the ones that we say can be solved "fast" or in Polynomial Time. NP is about harder problems, it stands for Non-deterministic Polynomial Time a class of problems that the worst case can be solved in Polynomial Time by Non-deterministic Turing machines. Still, there are NP-Hard/NP-Complete problems which there is no known way to solve in polynomial time. Although it is hard to find solutions, the solutions of all these problems are testable in polynomial time. Oppositely, solutions of problems in the class of EXPonential Time cannot be quickly tested. This MIT course can also help.
Last updated
Was this helpful?