To create a WordPress plugin, you’ll need to create a plugin folder within the wp-content/plugins directory, then create a main PHP file with a header and write your plugin code, following WordPress’s plugin development guidelines. Here’s a more detailed breakdown: Prerequisites: Notice that these are things we included in this course beforehand to make sure you were…
As I’ve talked about before, one thing that makes WordPress such a powerful tool and content management system (CMS), is that it is very extensible. Through plugins and themes, you can change a lot about how WordPress works by default. A big reason why we use plugins is that we can do it without touching…
Every spring the smell of delicious, spicy chili fills the air, and you get to taste all the entries at Tusculum University. In previous years, voting was done by filling out a piece of paper, and counting the entries by hand. This was a tedious and labor intensive process. So last year, I helped to…
An n-ary tree is similar to a binary tree. The difference is that with a Binary Tree node, you have at most 2 children. With an n-ary tree, you could have any number of children, based upon the design of the data structure. The difference is, while some languages/libraries will give you a ready made…
Exponential algorithms have a time complexity of O(n!), where n is the input size. These algorithms are generally inefficient and impractical for large inputs because of their rapid growth rate. Of all the different Big O notation problems, these are often considered the least efficient, and should be avoided if possible. Sometimes it cannot be…
An exponential O(2^n) algorithm is a type of algorithm that has a time complexity of O(2^n), where ‘n’ represents the size of the input data. This means that the running time of the algorithm increases exponentially with the size of the input. While we often see it written as 2n, the numeric value can actually…
You will sometimes see algorithms where in the Big O notation, they are raised to a power, such as O(n2), which is a quadratic algorithm, or O(n3) which is a cubic algorithm. The time complexity grows pretty quickly with both of these, or any other exponent. You will find that often these types of algorithms…
A linear O(n log n) algorithm is a type of algorithm that has a time complexity of O(n log n), where ‘n’ represents the number of elements in the input data. This means that the running time of the algorithm increases linearly with the size of the input, but with an additional logarithmic factor. Now…
