background preloader

Programming

Facebook Twitter

Reference

Technology. Api. Javascript. Tutorial. Python. Coding. Lean. JS charts – The free JavaScript chart generator. Top 14 tools for my web startup - A Programmer's 1st Solo Startup. A Better Way to Web Design. The next wave of programming languages - O'Reilly Radar. Order of Operations. 10 Advanced PHP Tips To Improve Your Programming | How-To. Advertisement Update (25.03.2009): this article contains some factual errors. Please read the rebuttal of this article instead of this article. PHP programming has climbed rapidly since its humble beginnings in 1995. Since then, PHP has become the most popular programming language for Web applications.

Many popular websites are powered by PHP, and an overwhelming majority of scripts and Web projects are built with the popular language. Because of PHP’s huge popularity, it has become almost impossible for Web developers not to have at least a working knowledge of PHP. 1. A list of common SQL injections. SQL injection is a nasty thing. Furruh Mavituna has a very nifty SQL injection cheat sheet that has a section on vulnerabilities with PHP and MySQL. 2.

PHP’s list of comparison operators. Comparison operators are a huge part of PHP, and some programmers may not be as well-versed in their differences as they ought. Just to be clear, == looks for equality, and === looks for identity. 3. 4. 5. Your Favorite NP-Complete Cheat. Have you ever heard a software engineer refer to a problem as "NP-complete"? That's fancy computer science jargon shorthand for "incredibly hard": The most notable characteristic of NP-complete problems is that no fast solution to them is known; that is, the time required to solve the problem using any currently known algorithm increases very quickly as the size of the problem grows. As a result, the time required to solve even moderately large versions of many of these problems easily reaches into the billions or trillions of years, using any amount of computing power available today. As a consequence, determining whether or not it is possible to solve these problems quickly is one of the principal unsolved problems in Computer Science today.

While a method for computing the solutions to NP-complete problems using a reasonable amount of time remains undiscovered, computer scientists and programmers still frequently encounter NP-complete problems. So how many problems are NP-complete?