Facebook
From Andreea, 2 Weeks ago, written in Plain Text.
Embed
Download Paste or View Raw
Hits: 157
  1. #1
  2. #a)
  3. Jobs = [] # TYPE LIST OF TYPE INTEGER WITH 100 LINES AND 2 COLUMNS
  4. for i in range(0,100):
  5.     Jobs.append([i,i])
  6. NumberOfJobs = 0  #TYPE INTEGER
  7.  
  8. #b
  9. def Initialise():
  10.     global Jobs
  11.     global NumberOfJobs
  12.     for i in range(0,100):
  13.         Jobs[i][0] = -1
  14.         Jobs[i][1] = -1
  15.     NumberOfJobs = 0
  16.  
  17. #c)
  18. def AddJob(JobNumber, JobPriority):
  19.     global Jobs
  20.     global NumberOfJobs
  21.     if NumberOfJobs == 100:
  22.         print("Not added")
  23.     else:
  24.         Jobs[NumberOfJobs][0] = JobNumber
  25.         Jobs[NumberOfJobs][1] = JobPriority
  26.         NumberOfJobs+=1
  27.         print("Added")
  28.  
  29. #d)
  30. Initialise()
  31. AddJob(12,10)
  32. AddJob(526, 9)
  33. AddJob(33,8)
  34. AddJob(12, 9)
  35. AddJob(78,1)
  36.  
  37. #e)
  38. def InsertionSort():
  39.     global Jobs
  40.     global NumberOfJobs
  41.     length = len(Jobs)
  42.     # print(Jobs)
  43.     Sorted = False
  44.     for i in range(1, NumberOfJobs): #i and j are POSITIONS
  45.         key = Jobs[i][1] #current element at position i
  46.         keylist = Jobs[i]
  47.         j = i - 1 #previous element at position j
  48.         # print(j)
  49.         while j >= 0 and key < Jobs[j][1]:
  50.             Jobs[j+1] = Jobs[j]
  51.             j-=1
  52.         Jobs[j+1] = keylist
  53.         print(Jobs)
  54.  
  55. #f)
  56. def PrintArray():
  57.     global Jobs
  58.     global NumberOfJobs
  59.     for i in range(0, NumberOfJobs+1):
  60.         print(Jobs[i][0], 'priority', Jobs[i][1])
  61.  
  62. #g)
  63. InsertionSort()
  64. PrintArray()