- Today
- Total
ListsAlgorithms & Development (29)
Running Deeper C/C++/Java
Radix sort uses a length based type of comparison, and has a time complexity of O(wn), where w is the length of the data. For cases where w is constant, and n is very large, the complexity O(wn) can be even faster than O(nlogn) algorithms (w>logn), and is a very useful tool to know. It is used where there is basically nothing more to optimize, but is an interesting idea. The following is a sourc..
First step: create a Maven ProjectAnd add the pom.xmlAdd neccesary jars to build path: Spigot 1.12.2 and Spigot 1.8.8 as those are the two minecraft versions I am working onNeed an onEnable and onDisable function to start, and can use the reload function to reconnect to databases and moreUsing a mySQL database to save my valuesOriginal source code is from Zedd7's zHorse plugin, using it to learn..