Build & Lexigraphical Permutations

This project provides documentation on two different approaches to permutations. Permutations can be generated by building them or by transposing characters between different character positions. My project addresses the efficiency between CPU speed and memory usage for generating unique permutations from input source texts that have repeated characters.

The challenge is to create an efficient algorithm that can have the capacity to permutate sources texts that are hundreds and thousands of characters long without running out of memory.

This project has 4 download files (1 pdf that documents the algorithms, and 3 Excel files, each for a different algorithm)

The downloadable Excel files are the programming files because I code in VBA. You will need to enable macros to run the algorithms. You can view the VBA code of each algorithm from the developer module house inside Microsoft Excel.

The lexigraphical algorithm is faster because it supports multi-threading.