Algorithm Development
Algorithms developed and optimized for specific mathematical, statistical and software-engineering problems.
This collection brings together early algorithm projects in which optimization meant changing the search space, state representation or computational model rather than merely writing a tighter loop.
Frequency Table Generation addresses statistical grouping; the NFA-to-DFA Converter turns a formal equivalence result into subset construction. Subset Sum Optimization compares exponential enumeration, dynamic programming and parallel execution, while Dudley's Hat explores reuse of subset-sum state to reduce repeated search work.
The Multithreaded Sorting experiment is now documented with an explicit distinction between a thread race and an isolated benchmark. Automaton-Based Substring Search and Huffman Optimization address text search and lossless coding.
The broader complexity context is in Data Structures and Algorithm Analysis.
Turkish Text Processing
My Turkish-language algorithm work covers different parts of the same problem space: Finite-State Turkish Syllabification, Numeric Soundex for Turkish Phonetic Matching, Turkish Deasciification in C#, Table-Based ASCII Conversion for Turkish Text and SentencePiece Tokenization, Normalization and Vocabulary Boundaries. The shared principle is to make Turkish character, morphology and pronunciation constraints explicit in the algorithm.
