input: def compare_heuristics_performance():
      """ Compare the performance of two different heuristics algorithms by measuring the time taken to execute each algorithm.
      The input data for both algorithms are predefined as data1 and data2.
      The comparison will print which algorithm is faster or if both have the same performance time.
      >>> compare_heuristics_performance()
      Algorithm 1 is faster than algorithm 2
      """
output:     import time
  
      data1 = [1, 2, 3, 4, 5]
      data2 = [6, 7, 8, 9, 10]
  
      def algorithm1(data):
          time.sleep(0.5)  # Simulate algorithm execution time
  
      def algorithm2(data):
          time.sleep(0.7)  # Simulate algorithm execution time
  
      start_time1 = time.time()
      algorithm1(data1)
      end_time1 = time.time()
      time1 = end_time1 - start_time1
  
      start_time2 = time.time()
      algorithm2(data2)
      end_time2 = time.time()
      time2 = end_time2 - start_time2
  
      if time1 < time2:
          print("Algorithm 1 is faster than algorithm 2")
      elif time1 > time2:
          print("Algorithm 2 is faster than algorithm 1")
      else:
          print("Both algorithms have the same performance time")