input: from typing import List
  
  def compare_heuristics_performance(data: List[List]) -> str:
      """
      Compare the performance of two different heuristics algorithms by measuring their execution time.
      The function takes in a list of two datasets and runs each algorithm on its respective dataset.
      It then prints which algorithm is faster or if they have the same performance time.
  
      >>> compare_heuristics_performance([[1, 2, 3], [4, 5, 6]])
      'Both algorithms have the same performance time'
      >>> compare_heuristics_performance([[99, 123, 456], [11, 22, 33]])
      'Algorithm 1 is faster than algorithm 2'
      """
output:     import time
  
      def heuristic_algorithm_1(dataset):
          time.sleep(0.1)  # Simulate algorithm execution time
  
      def heuristic_algorithm_2(dataset):
          time.sleep(0.2)  # Simulate algorithm execution time
  
      start_time_1 = time.time()
      heuristic_algorithm_1(data[0])
      end_time_1 = time.time()
  
      start_time_2 = time.time()
      heuristic_algorithm_2(data[1])
      end_time_2 = time.time()
  
      time_taken_1 = end_time_1 - start_time_1
      time_taken_2 = end_time_2 - start_time_2
  
      if time_taken_1 < time_taken_2:
          return 'Algorithm 1 is faster than algorithm 2'
      elif time_taken_1 > time_taken_2:
          return 'Algorithm 2 is faster than algorithm 1'
      else:
          return 'Both algorithms have the same performance time'