Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Floyd’s algorithm for heap construction | Statement: [Robert W. Floyd, notableWork, Floyd’s algorithm for heap construction]

Target entity: Floyd’s algorithm for heap construction
Context triple: [Robert W. Floyd, notableWork, Floyd’s algorithm for heap construction]

• A. Fibonacci heap
  A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
• B. Heapsort chosen
  Heapsort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements in-place with O(n log n) time complexity and O(1) auxiliary space.
• C. Kruskal’s minimum spanning tree algorithm
  Kruskal’s minimum spanning tree algorithm is a classic greedy graph algorithm that builds a minimum spanning tree by repeatedly adding the smallest-weight edge that does not create a cycle, typically implemented efficiently using a union–find data structure.
• D. pairing heap (as a practical alternative)
  A pairing heap is a simple, self-adjusting heap data structure that offers efficient practical performance for priority queue operations and is often used as an alternative to more complex structures like Fibonacci heaps.
• E. Cristian's algorithm
  Cristian's algorithm is a clock synchronization method in distributed systems that estimates accurate time on client machines by querying a time server and adjusting for message delays.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.