Iterative Douglas Peucker
potd: Palindromic Number

Problem of the day: Palindromic Numbers

A palindromic number is a number that reads the same forwards as it does
backwards. 123321 is a palindromic number where as 321321 is not.
Negative numbers may be considered palindromic or not; it's up to you
until someone proves otherwise.

Your mission, should you choose to accept it, is to create a program to
return whether a number is a palindromic number or not. To make things
slightly more interesting you may not use a string or array in your
solution. Thus doing something like "123.toString()" is not allowed.
Add @override
Add test for string reversal
Fix test: If needle does not exist return -1
Absstract ArrayAscendingArraySortTest
Simplify math
acme: RadixSort
acme: Find index of a substring - iterative

Iterative version without naming the loop
Move sort algorithms all to one package
Print permutations of the characters of a word
Bump maven-compiler-plugin to 3.1
Use Java 8
Remove nonsensical test
Clock Hands

Find the minimum angle between two hands on a 24 hour clock. For
instance, the angle at 6:00 is 90 degrees and the angle at 18:00 is also
90 degrees.