input: Write a function to find the Jaccard similarity between two given strings. The Jaccard similarity is calculated by dividing the size of the intersection of the sets of words in both strings by the size of their union. If the strings are empty, return 0.
  def get_jaccard_similarity(str1, str2):
      if str1 == "" and str2 == "":
          return 0
      a = set(str1.split()) 
      b = set(str2.split())
      c = a.intersection(b)
      return float(len(c)) / (len(a) + len(b) - len(c))
  
  assert get_jaccard_similarity("python programming", "java programming") == 0.5
  assert get_jaccard_similarity("hello world", "hello computer") == 0.3333333333333333
  assert get_jaccard_similarity("", "") == 0
  assert get_jaccard_similarity("new movie", "new film") == 0.5
output: def get_jaccard_similarity(str1, str2):
      if str1 == "" and str2 == "":
          return 0
      a = set(str1.split()) 
      b = set(str2.split())
      c = a.intersection(b)
      return float(len(c)) / (len(a) + len(b) - len(c))