CPU scheduling algorithm considers the elapsed time (summation of arrival time and burst time) for organizing and sequencing the processes. Based on the elapsed time, the corresponding parameters of time for each of the processes are sorted and stored. A loop is initialized until the queue gets empty. Within the loop, all the processes are repeatedly checked at constant intervals of time and the process with the least elapsed time is executed next.
