UpdateNeighbors.py

def UpdateNeighbors(neighbors,item,distance,k):
  if(len(neighbors) < k):
    #List is not full, add new item and sort
    neighbors.append([distance,item["Class"]]);
    neighbors = sorted(neighbors);
  else:
    #List is full
    #Check if new item should be added
    if(neighbors[-1][0] > distance):
      #If yes, replace the last element with new item
      neighbors[-1] = [distance,item["Class"]];
      neighbors = sorted(neighbors);

  return neighbors;