cs 322
COMBANITRIX A COMBINATORIAL ALGORITHMIC PROCEDURE
I. Rationale
An algorithm is a large-scale continuous study and research for the most time-convenient and resource-efficient mode of systematically doing things accurately. It predates the existence of computers. As such, algorithms arise more significantly as compared to computing technology.
Word-letter oriented games, applications and systems are but some of technological advancements that use heavy algorithm processes. As to this, we henceforth propose this new algorithm, a combinatorial procedure, which presents a systematic perspective in combining a set of characters bounded by a range of limiting expected output lengths.
II. Background of the Study
Technology – the harbinger of modern advancements in our society – is designed with the optimal and efficient capabilities of algorithmic processes. Those algorithmic processes pave way for the rise of tons of efficient real-life and theoretical solutions. One example of those algorithmic processes is a combinatorial procedure. It is a systematic way of both ordering and pairing of a set of values. The aspects under consideration to this algorithmic process are Flexibility, Stability, Efficiency, and Operational Capability.
III. Objectives
A. General Objective The main objective of this paper is to design and present a combinatorial procedure using our knowledge in existing algorithms, and to innovate it to complete its ordering capability with the least consumed memory and computing resources. The study aims to explore ways on combining elements with efficiency. The ultimate goal is to design and develop a combinatorial procedure that enables flexible and dynamic algorithmic functions imitating how the human brain does the work.
B. Specific Objectives The proposed algorithm specifically aims to:
1. Develop a combinatorial procedure limited to a set of input characters;
2. Implement a general brain logic imitating usual pairing process;
I. Rationale
An algorithm is a large-scale continuous study and research for the most time-convenient and resource-efficient mode of systematically doing things accurately. It predates the existence of computers. As such, algorithms arise more significantly as compared to computing technology.
Word-letter oriented games, applications and systems are but some of technological advancements that use heavy algorithm processes. As to this, we henceforth propose this new algorithm, a combinatorial procedure, which presents a systematic perspective in combining a set of characters bounded by a range of limiting expected output lengths.
II. Background of the Study
Technology – the harbinger of modern advancements in our society – is designed with the optimal and efficient capabilities of algorithmic processes. Those algorithmic processes pave way for the rise of tons of efficient real-life and theoretical solutions. One example of those algorithmic processes is a combinatorial procedure. It is a systematic way of both ordering and pairing of a set of values. The aspects under consideration to this algorithmic process are Flexibility, Stability, Efficiency, and Operational Capability.
III. Objectives
A. General Objective The main objective of this paper is to design and present a combinatorial procedure using our knowledge in existing algorithms, and to innovate it to complete its ordering capability with the least consumed memory and computing resources. The study aims to explore ways on combining elements with efficiency. The ultimate goal is to design and develop a combinatorial procedure that enables flexible and dynamic algorithmic functions imitating how the human brain does the work.
B. Specific Objectives The proposed algorithm specifically aims to:
1. Develop a combinatorial procedure limited to a set of input characters;
2. Implement a general brain logic imitating usual pairing process;