[Python] Scheduling algorithm FCFS in python

I need to implement First Come First Served scheduling algorithm in Python so I have to sort arrival time in ascending order. I get the error list index out of range. What should be the condition for sorting? I think my condition is correct, but it is not working.

arrival_time=[]

burst_time=[]

ch=int(input("Enter number of processes:"))

i=0

while i<ch:

a=int(input("Enter arrival time:"))
b=int(input("Enter burst time:"))
arrival_time.insert(i,a)
burst_time.insert(i,b)
i=i+1

print("Process Arrival Time Burst Time ")
print(arrival_time,burst_time)

count=0

for j in range(ch-1):
for l in range(l+1+count,ch):
if arrival_time[j]>arrival_time[l+1+count]:
temp=arrival_time[j]
arrival_time[j]=arrival_time[l+1+count]
arrival_time[l+1+count]=temp
count=count+1


print(arrival_time)
k=0
sum=0
print("Gantt Chart")

while k<ch:
if k==0:
sum=sum+burst_time[k]
print(arrival_time[k],"------",sum)

elif k>0:

sum1=sum+burst_time[k]
print("-------",sum1)

k=k+1

Continue reading...