This was planned to contain sorting algorithms, firstly to refresh my memory of such things and secondly to try develop in a purer TDD fashion.
It has since started to expand into searching and encrypting algorithms as well
| Algorithm | Best Performance | Avg | Worst |
|---|---|---|---|
| Quick Sort | n log n (var n) | n log n | n2 |
| Bubble Sort | n log n | n log n | n log n |
| Heap Sort | n log n | n log n | n log n |
| Algorithm | Best Performance | Avg | Worst |
|---|---|---|---|
| Lineary Search | 1 | n | n |
| Binary Search | 1 | log n | log n |
- Merge Sort
- Transpositional Ciphers and their variants [Rail Fence cipher | Route cipher | Columnar transposition | Double transposition | Myszkowski transposition]
- Others and Others Still
- Hashing & Digital searches
A mutation testing suite for Java.
TODO: This causes a little problem with simple sorting as Pitest will detect errors in the logic of non-stable sorting algorithms. In that if any item is compared with another of equal value both a<b and a<=b are valid and this is one of Pitests mutations. I'll need to add tests to validate the stability of algorithms using objects other than integers (for more complex equality) in order to kill this mutation.