User:EyeEatCrayons

I program algorithms for various tasks. Interested in Data compression lossy or lossless, the Travelling Salesman Problem and Sorting algorithms.

I created an in-place non-comparison sorting algorithm with $$O(n)$$ best case, $$O(n+k)$$ average case and $$O(n log n)$$ worst case and an entropy encoding method similar to Huffman coding, Lempel–Ziv–Storer–Szymanski and Lempel-Ziv-Welch that runs in $$O(i*n^2)$$