round robin scheduling algorithm

[m4wk]

Hey guys. I am working on an assignment that will emulate cpu scheduling algorithms with an array of structs of process information. Right now I have FirstComeFirstServe completed and i'm working on round robin. Here is the FCFS code: http://pastebin.com/9MihwuPY

I have found some code on the web of the round robin algorithm, but the person has written it using different types of data structures, and I'm having a hard time converting it to use with my structs. Maybe you guys can give me some help? I have part of it completed:

void RR15(Process P[])
{
        int q = 15; //q is the time quantum
        int sp = 0; //time spent
        int i, k, time, j = 0;
        Process temp[50];
        bool f = false; //flag to indicate whether any process
                        //was scheduled as i changed from 0 n-1
                        //in the next for loop

        //while there are uncompleted processes
        for(i=0; j < 50; i=(i+1)%50)
        {
                //find the next uncompleted processes which has already
                //or just arived
                if(P[i].CPU_Burst>0 && sp>=P[i].Arrival_Time)
                {
                        f=true;
                        //if process requests for time less than quantum
                        if(P[i].CPU_Time <= q)
                                time = P[i].CPU_Burst;
                        else
                                time = q;

                        //schedule the process
                        P[i].Turn_Time += time, P[i].CPU_Burst....?
}

And here's the code I have been basing it off of (code I've been following is in the calc() function): http://pastebin.com/tNYkxedF

Can anyone look at my code and tell me if what I have so far seems correct? or what I do next? I got stuck at the //schedule the process .

[m4wk]

EDIT: this is solved.