def nonBINinsREC(list,i,item):
  #recursive code to INSERT _item_ in _list_
  #this code returns
  #the INDEX where the element _item_ should
  #be inserted
  if i==0:
    return 0
  elif item>list[i]:
    return i+1
  else:
    return nonBINinsREC(list,i-1,item)
mylist=[2,4,23,45,89]
myitem=14
q=nonBINinsREC(mylist,len(mylist)-1,myitem)
print(mylist[:q]+[myitem]+mylist[q:])