Two major issues were looming over the battle system project this morning: the initiative array, and the action processor. With the use of a tagged array bubblesort (unstable parallel reference type, stability wasn't necessary since only one value was compared), the initiative array is now finished, and only the action processor remains. Fortunately, the action processor is MUCH easier to implement. Alpha 3 will be built today without question.
Some nerdly reference for the curious...
A tagged array is where you have two arrays with associated indexes, independent of the value of either. When one array is sorted, its associated array is sorted equally, except the associated array is sorted by index, regardless of its value. So, if your sort array contains values like [45, 32, 109] and your associated array contains values such as [1, 2, 3], sorting the first array will result in [109, 45, 32] and the associated array will result in [3, 1, 2]. The bubblesort is, of course, not the fastest sorting algorithm there is, and I sure wouldn't use it for an action game, but for a one-shot operation in an RPG battle system, it's small and efficient...sure beats the size of a qsort.