C# - String Arrays

I've drafted up a solution using queues. I'm not really that good at C#, so I'm sure there's a couple of syntax errors and typos, but I hope this gets you on the right track.

class Program{
    string [] Opponents             = ...;
    int       currentPlace          = 0;
    int       curWaveNum            = 0;
    int       newWaveSize           = 5;
    int       newEnemiesPerWave     = 2;
    int       enemiesRemovedPerWave = 3;

    // Creates a queue, or a "FIFO" (First In, First Out) data structure.
    Queue myQ = newQueue();

    void addWave(){
        // Remove enemies until you've gotten to enemiesRemovedPerWave, or until the
        // wave is empty
        for(int i = 0 ; i < enemiesRemovedPerWave ; i++){
            if(myQ.count == 0){
                break;
            }
            myQ.Dequeue();
        }

        // Set toAdd to be newWaveSize if the queue is empty, or newEnemiesPerWave if
        // it's not empty
        int toAdd = (myQ.count == 0 ? newWaveSize : newEnemiesPerWave);

        // Add the enemies to the queue, from the Opponents array
        for(int i = 0 ; i < toAdd ; i++){
            // If there's only one enemy left in the Opponents array, only attempt 
            // to add one enemy to myQ
            if(currentPlace + i >= Opponents.count){
                break;
            }
            else{
                // Actually add to the queue
                myQ.enqueue(Opponents[currentPlace + i]);
            }
        }
        // Update currentPlace.  Note that you could have the above for loop be:
        // for( ; currentPlace < currentPlace + toAdd ; currentPlace++)
        // but I think how I wrote it is easier to understand
        currentPlace += toAdd;
    }
    void printWave(){
        Console.write("Wave %d: ", waveNum);
        // Print everything but the last one
        for(int i = 0 ; i < myQ.count - 1 ; i++){
            Console.write(myQ[i] + ", ");
        }
        Console.write(myQ[myQ.count - 1] + "\n");
    }
    public void play(){
        while(currentPlace < Opponents.count){
            addWave();
            printWave();
            curWaveNum++;
        }
    }
}

The key to this is a data structure called a Queue. Think of it as an actual queue (line) at a store--the first people to get in line are served first. This is in contrast to a "LIFO" data structure, known as a Stack. A Stack behaves like, well, a stack of pancakes. When you make pancakes, you typically put the newest cooked ones on top, meaning the first pancake to bee taken will be the last one that was made, hence "LIFO," or "Last In, First Out."

You can read more about the functions defined for queues here!

Edit: Added printWave and play